TSTP Solution File: SWV388+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV388+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:18 EDT 2024
% Result : Theorem 2.99s 1.07s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_l34) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f84]) ).
fof(f92,plain,
( ? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) )
=> ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f85,f92]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f143,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f93]) ).
fof(f144,plain,
check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f93]) ).
cnf(c_95,plain,
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f142]) ).
cnf(c_97,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f144]) ).
cnf(c_98,negated_conjecture,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f143]) ).
cnf(c_912,plain,
triple(sK0,sK1,sK2) = sP0_iProver_def,
definition ).
cnf(c_913,plain,
findmin_cpq_eff(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_914,negated_conjecture,
~ check_cpq(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_98,c_912]) ).
cnf(c_915,negated_conjecture,
check_cpq(sP1_iProver_def),
inference(demodulation,[status(thm)],[c_97,c_913]) ).
cnf(c_1560,plain,
( ~ check_cpq(findmin_cpq_eff(sP0_iProver_def))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(superposition,[status(thm)],[c_912,c_95]) ).
cnf(c_1561,plain,
( ~ check_cpq(sP1_iProver_def)
| check_cpq(sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_1560,c_912,c_913]) ).
cnf(c_1562,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1561,c_914,c_915]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWV388+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n031.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 00:43:31 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 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
% 2.99/1.07 % SZS status Started for theBenchmark.p
% 2.99/1.07 % SZS status Theorem for theBenchmark.p
% 2.99/1.07
% 2.99/1.07 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.99/1.07
% 2.99/1.07 ------ iProver source info
% 2.99/1.07
% 2.99/1.07 git: date: 2024-05-02 19:28:25 +0000
% 2.99/1.07 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.99/1.07 git: non_committed_changes: false
% 2.99/1.07
% 2.99/1.07 ------ Parsing...
% 2.99/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.99/1.07
% 2.99/1.07 ------ 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
% 2.99/1.07
% 2.99/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.99/1.07
% 2.99/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.99/1.07 ------ Proving...
% 2.99/1.07 ------ Problem Properties
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07 clauses 45
% 2.99/1.07 conjectures 3
% 2.99/1.07 EPR 9
% 2.99/1.07 Horn 31
% 2.99/1.07 unary 20
% 2.99/1.07 binary 13
% 2.99/1.07 lits 83
% 2.99/1.07 lits eq 30
% 2.99/1.07 fd_pure 0
% 2.99/1.07 fd_pseudo 0
% 2.99/1.07 fd_cond 5
% 2.99/1.07 fd_pseudo_cond 5
% 2.99/1.07 AC symbols 0
% 2.99/1.07
% 2.99/1.07 ------ Schedule dynamic 5 is on
% 2.99/1.07
% 2.99/1.07 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07 ------
% 2.99/1.07 Current options:
% 2.99/1.07 ------
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07 ------ Proving...
% 2.99/1.07
% 2.99/1.07
% 2.99/1.07 % SZS status Theorem for theBenchmark.p
% 2.99/1.07
% 2.99/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.99/1.07
% 2.99/1.07
%------------------------------------------------------------------------------