TSTP Solution File: LCL903+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL903+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Thu Aug 31 07:52:56 EDT 2023
% Result : Theorem 7.73s 1.66s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 55 unt; 0 def)
% Number of atoms : 135 ( 41 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 88 ( 41 ~; 33 |; 5 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 161 ( 18 sgn; 75 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] : '+'('+'(X0,X1),X2) = '+'(X0,'+'(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f2,axiom,
! [X0,X1] : '+'(X0,X1) = '+'(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f3,axiom,
! [X0] : '+'(X0,'0') = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(f4,axiom,
! [X0] : '>='(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f5,axiom,
! [X3,X4,X5] :
( ( '>='(X4,X5)
& '>='(X3,X4) )
=> '>='(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(f6,axiom,
! [X6,X7] :
( ( '>='(X7,X6)
& '>='(X6,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f7,axiom,
! [X8,X9,X10] :
( '>='('+'(X8,X9),X10)
<=> '>='(X9,'==>'(X8,X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f8,axiom,
! [X0] : '>='(X0,'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X14,X15,X16] :
( '>='(X14,X15)
=> '>='('==>'(X15,X16),'==>'(X14,X16)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(f12,axiom,
! [X0] : '1' = '+'(X0,'1'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(f13,axiom,
! [X0] : '0' = '==>'('==>'('==>'(X0,'1'),X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(f14,conjecture,
! [X20] : '+'(X20,X20) = X20,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
fof(f15,negated_conjecture,
~ ! [X20] : '+'(X20,X20) = X20,
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( '>='(X1,X2)
& '>='(X0,X1) )
=> '>='(X0,X2) ),
inference(rectify,[],[f5]) ).
fof(f17,plain,
! [X0,X1] :
( ( '>='(X1,X0)
& '>='(X0,X1) )
=> X0 = X1 ),
inference(rectify,[],[f6]) ).
fof(f18,plain,
! [X0,X1,X2] :
( '>='('+'(X0,X1),X2)
<=> '>='(X1,'==>'(X0,X2)) ),
inference(rectify,[],[f7]) ).
fof(f20,plain,
! [X0,X1,X2] :
( '>='(X0,X1)
=> '>='('==>'(X1,X2),'==>'(X0,X2)) ),
inference(rectify,[],[f10]) ).
fof(f22,plain,
~ ! [X0] : '+'(X0,X0) = X0,
inference(rectify,[],[f15]) ).
fof(f23,plain,
! [X0,X1,X2] :
( '>='(X0,X2)
| ~ '>='(X1,X2)
| ~ '>='(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0,X1,X2] :
( '>='(X0,X2)
| ~ '>='(X1,X2)
| ~ '>='(X0,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( X0 = X1
| ~ '>='(X1,X0)
| ~ '>='(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f26,plain,
! [X0,X1] :
( X0 = X1
| ~ '>='(X1,X0)
| ~ '>='(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f28,plain,
! [X0,X1,X2] :
( '>='('==>'(X1,X2),'==>'(X0,X2))
| ~ '>='(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f30,plain,
? [X0] : '+'(X0,X0) != X0,
inference(ennf_transformation,[],[f22]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( '>='('+'(X0,X1),X2)
| ~ '>='(X1,'==>'(X0,X2)) )
& ( '>='(X1,'==>'(X0,X2))
| ~ '>='('+'(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f32,plain,
( ? [X0] : '+'(X0,X0) != X0
=> sK0 != '+'(sK0,sK0) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
sK0 != '+'(sK0,sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f32]) ).
fof(f34,plain,
! [X2,X0,X1] : '+'('+'(X0,X1),X2) = '+'(X0,'+'(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
fof(f35,plain,
! [X0,X1] : '+'(X0,X1) = '+'(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f36,plain,
! [X0] : '+'(X0,'0') = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f37,plain,
! [X0] : '>='(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f38,plain,
! [X2,X0,X1] :
( '>='(X0,X2)
| ~ '>='(X1,X2)
| ~ '>='(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X0,X1] :
( X0 = X1
| ~ '>='(X1,X0)
| ~ '>='(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f40,plain,
! [X2,X0,X1] :
( '>='(X1,'==>'(X0,X2))
| ~ '>='('+'(X0,X1),X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f41,plain,
! [X2,X0,X1] :
( '>='('+'(X0,X1),X2)
| ~ '>='(X1,'==>'(X0,X2)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f42,plain,
! [X0] : '>='(X0,'0'),
inference(cnf_transformation,[],[f8]) ).
fof(f44,plain,
! [X2,X0,X1] :
( '>='('==>'(X1,X2),'==>'(X0,X2))
| ~ '>='(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
! [X0] : '1' = '+'(X0,'1'),
inference(cnf_transformation,[],[f12]) ).
fof(f47,plain,
! [X0] : '0' = '==>'('==>'('==>'(X0,'1'),X0),X0),
inference(cnf_transformation,[],[f13]) ).
fof(f48,plain,
sK0 != '+'(sK0,sK0),
inference(cnf_transformation,[],[f33]) ).
cnf(c_49,plain,
'+'('+'(X0,X1),X2) = '+'(X0,'+'(X1,X2)),
inference(cnf_transformation,[],[f34]) ).
cnf(c_50,plain,
'+'(X0,X1) = '+'(X1,X0),
inference(cnf_transformation,[],[f35]) ).
cnf(c_51,plain,
'+'(X0,'0') = X0,
inference(cnf_transformation,[],[f36]) ).
cnf(c_52,plain,
'>='(X0,X0),
inference(cnf_transformation,[],[f37]) ).
cnf(c_53,plain,
( ~ '>='(X0,X1)
| ~ '>='(X1,X2)
| '>='(X0,X2) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
( ~ '>='(X0,X1)
| ~ '>='(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_55,plain,
( ~ '>='(X0,'==>'(X1,X2))
| '>='('+'(X1,X0),X2) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_56,plain,
( ~ '>='('+'(X0,X1),X2)
| '>='(X1,'==>'(X0,X2)) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
'>='(X0,'0'),
inference(cnf_transformation,[],[f42]) ).
cnf(c_59,plain,
( ~ '>='(X0,X1)
| '>='('==>'(X1,X2),'==>'(X0,X2)) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_61,plain,
'+'(X0,'1') = '1',
inference(cnf_transformation,[],[f46]) ).
cnf(c_62,plain,
'==>'('==>'('==>'(X0,'1'),X0),X0) = '0',
inference(cnf_transformation,[],[f47]) ).
cnf(c_63,negated_conjecture,
'+'(sK0,sK0) != sK0,
inference(cnf_transformation,[],[f48]) ).
cnf(c_332,plain,
'+'('1',X0) = '1',
inference(superposition,[status(thm)],[c_50,c_61]) ).
cnf(c_374,plain,
'>='('+'(X0,'==>'(X0,X1)),X1),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_375,plain,
( ~ '>='(X0,'0')
| '>='('+'('==>'('==>'(X1,'1'),X1),X0),X1) ),
inference(superposition,[status(thm)],[c_62,c_55]) ).
cnf(c_376,plain,
'>='('+'('==>'('==>'(X0,'1'),X0),X1),X0),
inference(forward_subsumption_resolution,[status(thm)],[c_375,c_57]) ).
cnf(c_383,plain,
'>='(X0,'==>'(X1,'+'(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_416,plain,
'>='('1',X0),
inference(superposition,[status(thm)],[c_332,c_374]) ).
cnf(c_436,plain,
( ~ '>='(X0,'1')
| '>='(X0,X1) ),
inference(superposition,[status(thm)],[c_416,c_53]) ).
cnf(c_449,plain,
'>='('0','==>'(X0,X0)),
inference(superposition,[status(thm)],[c_51,c_383]) ).
cnf(c_471,plain,
( ~ '>='(X0,'0')
| '>='(X0,'==>'(X1,X1)) ),
inference(superposition,[status(thm)],[c_449,c_53]) ).
cnf(c_474,plain,
'>='(X0,'==>'(X1,X1)),
inference(forward_subsumption_resolution,[status(thm)],[c_471,c_57]) ).
cnf(c_495,plain,
'>='('+'(X0,X1),X0),
inference(superposition,[status(thm)],[c_474,c_55]) ).
cnf(c_499,plain,
'>='('+'(X0,X1),X1),
inference(superposition,[status(thm)],[c_50,c_495]) ).
cnf(c_527,plain,
'>='(X0,'==>'(X1,X0)),
inference(superposition,[status(thm)],[c_499,c_56]) ).
cnf(c_680,plain,
'>='('+'(X0,'+'(X1,X2)),'+'(X0,X1)),
inference(superposition,[status(thm)],[c_49,c_495]) ).
cnf(c_764,plain,
'>='('+'(X0,'==>'(X0,'1')),X1),
inference(superposition,[status(thm)],[c_374,c_436]) ).
cnf(c_938,plain,
'>='('==>'(X0,'1'),'==>'(X0,X1)),
inference(superposition,[status(thm)],[c_764,c_56]) ).
cnf(c_1069,plain,
( ~ '>='('0',X0)
| X0 = '0' ),
inference(superposition,[status(thm)],[c_57,c_54]) ).
cnf(c_1538,plain,
'>='('==>'('==>'(X0,'1'),X0),X0),
inference(superposition,[status(thm)],[c_51,c_376]) ).
cnf(c_1631,plain,
( ~ '>='(X0,'==>'('==>'(X0,'1'),X0))
| '==>'('==>'(X0,'1'),X0) = X0 ),
inference(superposition,[status(thm)],[c_1538,c_54]) ).
cnf(c_1637,plain,
'==>'('==>'(X0,'1'),X0) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_1631,c_527]) ).
cnf(c_1651,plain,
( ~ '>='('==>'(X0,'1'),X1)
| '>='('==>'(X1,X0),X0) ),
inference(superposition,[status(thm)],[c_1637,c_59]) ).
cnf(c_2284,plain,
'>='('+'(X0,'+'(X1,X2)),'+'(X1,X0)),
inference(superposition,[status(thm)],[c_50,c_680]) ).
cnf(c_3517,plain,
'>='('+'(X0,X1),'==>'(X2,'+'(X0,X2))),
inference(superposition,[status(thm)],[c_2284,c_56]) ).
cnf(c_4705,plain,
'>='(X0,'==>'(X1,'==>'(X2,'+'(X1,X2)))),
inference(superposition,[status(thm)],[c_3517,c_56]) ).
cnf(c_5666,plain,
'==>'(X0,'==>'(X1,'+'(X0,X1))) = '0',
inference(superposition,[status(thm)],[c_4705,c_1069]) ).
cnf(c_16767,plain,
'>='('==>'('==>'(X0,X1),X0),X0),
inference(superposition,[status(thm)],[c_938,c_1651]) ).
cnf(c_17100,plain,
( ~ '>='(X0,'==>'('==>'(X0,X1),X0))
| '==>'('==>'(X0,X1),X0) = X0 ),
inference(superposition,[status(thm)],[c_16767,c_54]) ).
cnf(c_17126,plain,
'==>'('==>'(X0,X1),X0) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_17100,c_527]) ).
cnf(c_17195,plain,
'==>'(X0,'==>'(X0,X1)) = '==>'(X0,X1),
inference(superposition,[status(thm)],[c_17126,c_17126]) ).
cnf(c_34285,plain,
'==>'(X0,'+'(X0,X0)) = '0',
inference(superposition,[status(thm)],[c_17195,c_5666]) ).
cnf(c_34438,plain,
'>='('+'(X0,'0'),'+'(X0,X0)),
inference(superposition,[status(thm)],[c_34285,c_374]) ).
cnf(c_34509,plain,
'>='(X0,'+'(X0,X0)),
inference(light_normalisation,[status(thm)],[c_34438,c_51]) ).
cnf(c_34768,plain,
( ~ '>='('+'(X0,X0),X0)
| '+'(X0,X0) = X0 ),
inference(superposition,[status(thm)],[c_34509,c_54]) ).
cnf(c_34797,plain,
'+'(X0,X0) = X0,
inference(forward_subsumption_resolution,[status(thm)],[c_34768,c_495]) ).
cnf(c_34798,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_34797]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL903+1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 04:23:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.73/1.66 % SZS status Started for theBenchmark.p
% 7.73/1.66 % SZS status Theorem for theBenchmark.p
% 7.73/1.66
% 7.73/1.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.73/1.66
% 7.73/1.66 ------ iProver source info
% 7.73/1.66
% 7.73/1.66 git: date: 2023-05-31 18:12:56 +0000
% 7.73/1.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.73/1.66 git: non_committed_changes: false
% 7.73/1.66 git: last_make_outside_of_git: false
% 7.73/1.66
% 7.73/1.66 ------ Parsing...
% 7.73/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.73/1.66
% 7.73/1.66 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.73/1.66
% 7.73/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.73/1.66
% 7.73/1.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.73/1.66 ------ Proving...
% 7.73/1.66 ------ Problem Properties
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 clauses 15
% 7.73/1.66 conjectures 1
% 7.73/1.66 EPR 4
% 7.73/1.66 Horn 15
% 7.73/1.66 unary 8
% 7.73/1.66 binary 5
% 7.73/1.66 lits 24
% 7.73/1.66 lits eq 7
% 7.73/1.66 fd_pure 0
% 7.73/1.66 fd_pseudo 0
% 7.73/1.66 fd_cond 0
% 7.73/1.66 fd_pseudo_cond 1
% 7.73/1.66 AC symbols 1
% 7.73/1.66
% 7.73/1.66 ------ Schedule dynamic 5 is on
% 7.73/1.66
% 7.73/1.66 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 ------
% 7.73/1.66 Current options:
% 7.73/1.66 ------
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 ------ Proving...
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 % SZS status Theorem for theBenchmark.p
% 7.73/1.66
% 7.73/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.66
% 7.73/1.66
%------------------------------------------------------------------------------