TSTP Solution File: GEO524+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO524+1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 06:15:03 EDT 2024
% Result : Theorem 4.10s 1.20s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f188,axiom,
! [X11,X14,X12,X36] :
( reflect(X11,X14,X36) = X12
| reflect(X11,X14,X12) != X36
| X11 = X14 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_6) ).
fof(f189,conjecture,
! [X11,X14,X12,X15] :
( X12 = X15
| reflect(X11,X14,X12) != reflect(X11,X14,X15)
| X11 = X14 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_7) ).
fof(f190,negated_conjecture,
~ ! [X11,X14,X12,X15] :
( X12 = X15
| reflect(X11,X14,X12) != reflect(X11,X14,X15)
| X11 = X14 ),
inference(negated_conjecture,[],[f189]) ).
fof(f384,plain,
! [X0,X1,X2,X3] :
( reflect(X0,X1,X3) = X2
| reflect(X0,X1,X2) != X3
| X0 = X1 ),
inference(rectify,[],[f188]) ).
fof(f385,plain,
~ ! [X0,X1,X2,X3] :
( X2 = X3
| reflect(X0,X1,X2) != reflect(X0,X1,X3)
| X0 = X1 ),
inference(rectify,[],[f190]) ).
fof(f401,plain,
? [X0,X1,X2,X3] :
( X2 != X3
& reflect(X0,X1,X2) = reflect(X0,X1,X3)
& X0 != X1 ),
inference(ennf_transformation,[],[f385]) ).
fof(f402,plain,
( ? [X0,X1,X2,X3] :
( X2 != X3
& reflect(X0,X1,X2) = reflect(X0,X1,X3)
& X0 != X1 )
=> ( sK2 != sK3
& reflect(sK0,sK1,sK2) = reflect(sK0,sK1,sK3)
& sK0 != sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f403,plain,
( sK2 != sK3
& reflect(sK0,sK1,sK2) = reflect(sK0,sK1,sK3)
& sK0 != sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f401,f402]) ).
fof(f622,plain,
! [X2,X3,X0,X1] :
( reflect(X0,X1,X3) = X2
| reflect(X0,X1,X2) != X3
| X0 = X1 ),
inference(cnf_transformation,[],[f384]) ).
fof(f623,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f403]) ).
fof(f624,plain,
reflect(sK0,sK1,sK2) = reflect(sK0,sK1,sK3),
inference(cnf_transformation,[],[f403]) ).
fof(f625,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f403]) ).
fof(f722,plain,
! [X2,X0,X1] :
( reflect(X0,X1,reflect(X0,X1,X2)) = X2
| X0 = X1 ),
inference(equality_resolution,[],[f622]) ).
cnf(c_267,plain,
( reflect(X0,X1,reflect(X0,X1,X2)) = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f722]) ).
cnf(c_268,negated_conjecture,
sK2 != sK3,
inference(cnf_transformation,[],[f625]) ).
cnf(c_269,negated_conjecture,
reflect(sK0,sK1,sK2) = reflect(sK0,sK1,sK3),
inference(cnf_transformation,[],[f624]) ).
cnf(c_270,negated_conjecture,
sK0 != sK1,
inference(cnf_transformation,[],[f623]) ).
cnf(c_7406,plain,
reflect(sK0,sK1,sK2) = sP0_iProver_def,
definition ).
cnf(c_7407,plain,
reflect(sK0,sK1,sK3) = sP1_iProver_def,
definition ).
cnf(c_7408,negated_conjecture,
sK0 != sK1,
inference(demodulation,[status(thm)],[c_270]) ).
cnf(c_7409,negated_conjecture,
sP0_iProver_def = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_269,c_7407,c_7406]) ).
cnf(c_7410,negated_conjecture,
sK2 != sK3,
inference(demodulation,[status(thm)],[c_268]) ).
cnf(c_10649,plain,
reflect(sK0,sK1,sK3) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_7407,c_7409]) ).
cnf(c_13603,plain,
( reflect(sK0,sK1,sP0_iProver_def) = sK2
| sK0 = sK1 ),
inference(superposition,[status(thm)],[c_7406,c_267]) ).
cnf(c_13604,plain,
( reflect(sK0,sK1,sP0_iProver_def) = sK3
| sK0 = sK1 ),
inference(superposition,[status(thm)],[c_10649,c_267]) ).
cnf(c_13606,plain,
reflect(sK0,sK1,sP0_iProver_def) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_13604,c_7408]) ).
cnf(c_13607,plain,
reflect(sK0,sK1,sP0_iProver_def) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_13603,c_7408]) ).
cnf(c_13610,plain,
sK2 = sK3,
inference(demodulation,[status(thm)],[c_13606,c_13607]) ).
cnf(c_13611,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13610,c_7410]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO524+1 : TPTP v8.2.0. Released v7.0.0.
% 0.12/0.12 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 08:48:24 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.10/1.20 % SZS status Started for theBenchmark.p
% 4.10/1.20 % SZS status Theorem for theBenchmark.p
% 4.10/1.20
% 4.10/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.10/1.20
% 4.10/1.20 ------ iProver source info
% 4.10/1.20
% 4.10/1.20 git: date: 2024-06-12 09:56:46 +0000
% 4.10/1.20 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.10/1.20 git: non_committed_changes: false
% 4.10/1.20
% 4.10/1.20 ------ Parsing...
% 4.10/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.10/1.20
% 4.10/1.20 ------ Preprocessing... sup_sim: 17 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 4.10/1.20
% 4.10/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.10/1.20
% 4.10/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.10/1.20 ------ Proving...
% 4.10/1.20 ------ Problem Properties
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20 clauses 241
% 4.10/1.20 conjectures 3
% 4.10/1.20 EPR 146
% 4.10/1.20 Horn 170
% 4.10/1.20 unary 38
% 4.10/1.20 binary 89
% 4.10/1.20 lits 748
% 4.10/1.20 lits eq 164
% 4.10/1.20 fd_pure 0
% 4.10/1.20 fd_pseudo 0
% 4.10/1.20 fd_cond 0
% 4.10/1.20 fd_pseudo_cond 78
% 4.10/1.20 AC symbols 0
% 4.10/1.20
% 4.10/1.20 ------ Schedule dynamic 5 is on
% 4.10/1.20
% 4.10/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20 ------
% 4.10/1.20 Current options:
% 4.10/1.20 ------
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20 ------ Proving...
% 4.10/1.20
% 4.10/1.20
% 4.10/1.20 % SZS status Theorem for theBenchmark.p
% 4.10/1.20
% 4.10/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/1.20
% 4.10/1.20
%------------------------------------------------------------------------------