TSTP Solution File: SWV377+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV377+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Fri May 3 03:14:17 EDT 2024
% Result : Theorem 3.03s 1.14s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> bad = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax41) ).
fof(f30,axiom,
! [X0,X1,X2,X3] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f42,conjecture,
! [X0,X1,X2,X3] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(insert_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l13_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(negated_conjecture,[],[f42]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f69,plain,
! [X0,X1,X2] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ok(insert_cpq(triple(X0,X1,X2),X3))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ? [X0,X1,X2,X3] :
( ok(insert_cpq(triple(X0,X1,X2),X3))
& ~ ok(triple(X0,X1,X2)) )
=> ( ok(insert_cpq(triple(sK0,sK1,sK2),sK3))
& ~ ok(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( ok(insert_cpq(triple(sK0,sK1,sK2),sK3))
& ~ ok(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f82,f89]) ).
fof(f125,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f126,plain,
! [X2,X0,X1] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f69]) ).
fof(f127,plain,
! [X2,X3,X0,X1] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
inference(cnf_transformation,[],[f30]) ).
fof(f139,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f90]) ).
fof(f140,plain,
ok(insert_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f90]) ).
cnf(c_83,plain,
~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f125]) ).
cnf(c_84,plain,
( X0 = bad
| ok(triple(X1,X2,X0)) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_85,plain,
triple(insert_pqp(X0,X1),insert_slb(X2,pair(X1,bottom)),X3) = insert_cpq(triple(X0,X2,X3),X1),
inference(cnf_transformation,[],[f127]) ).
cnf(c_95,negated_conjecture,
ok(insert_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f140]) ).
cnf(c_96,negated_conjecture,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f139]) ).
cnf(c_919,plain,
triple(sK0,sK1,sK2) = sP0_iProver_def,
definition ).
cnf(c_920,plain,
insert_cpq(sP0_iProver_def,sK3) = sP1_iProver_def,
definition ).
cnf(c_921,negated_conjecture,
~ ok(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_96,c_919]) ).
cnf(c_922,negated_conjecture,
ok(sP1_iProver_def),
inference(demodulation,[status(thm)],[c_95,c_920]) ).
cnf(c_1480,plain,
~ ok(insert_cpq(triple(X0,X1,bad),X2)),
inference(superposition,[status(thm)],[c_85,c_83]) ).
cnf(c_1489,plain,
( bad = sK2
| ok(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_919,c_84]) ).
cnf(c_1491,plain,
bad = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_1489,c_921]) ).
cnf(c_1494,plain,
triple(sK0,sK1,bad) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_919,c_1491]) ).
cnf(c_1496,plain,
~ ok(insert_cpq(sP0_iProver_def,X0)),
inference(superposition,[status(thm)],[c_1494,c_1480]) ).
cnf(c_1500,plain,
~ ok(sP1_iProver_def),
inference(superposition,[status(thm)],[c_920,c_1496]) ).
cnf(c_1501,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1500,c_922]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV377+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:25:07 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.03/1.14 % SZS status Started for theBenchmark.p
% 3.03/1.14 % SZS status Theorem for theBenchmark.p
% 3.03/1.14
% 3.03/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.03/1.14
% 3.03/1.14 ------ iProver source info
% 3.03/1.14
% 3.03/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.03/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.03/1.14 git: non_committed_changes: false
% 3.03/1.14
% 3.03/1.14 ------ Parsing...
% 3.03/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.03/1.14
% 3.03/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 3.03/1.14
% 3.03/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.03/1.14
% 3.03/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.03/1.14 ------ Proving...
% 3.03/1.14 ------ Problem Properties
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14 clauses 43
% 3.03/1.14 conjectures 2
% 3.03/1.14 EPR 8
% 3.03/1.14 Horn 29
% 3.03/1.14 unary 19
% 3.03/1.14 binary 12
% 3.03/1.14 lits 80
% 3.03/1.14 lits eq 30
% 3.03/1.14 fd_pure 0
% 3.03/1.14 fd_pseudo 0
% 3.03/1.14 fd_cond 5
% 3.03/1.14 fd_pseudo_cond 5
% 3.03/1.14 AC symbols 0
% 3.03/1.14
% 3.03/1.14 ------ Schedule dynamic 5 is on
% 3.03/1.14
% 3.03/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14 ------
% 3.03/1.14 Current options:
% 3.03/1.14 ------
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14 ------ Proving...
% 3.03/1.14
% 3.03/1.14
% 3.03/1.14 % SZS status Theorem for theBenchmark.p
% 3.03/1.14
% 3.03/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.03/1.14
% 3.03/1.14
%------------------------------------------------------------------------------