TSTP Solution File: GEO083+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO083+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : 600s
% DateTime : Sat Jul 16 03:43:13 EDT 2022
% Result : Theorem 8.13s 2.46s
% Output : CNFRefutation 8.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 8 unt; 9 nHn; 21 RR)
% Number of literals : 58 ( 6 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_47,plain,
( incident_c(X1,X2)
| incident_c(X1,X3)
| X4 != sum(X3,X2)
| ~ incident_c(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_47) ).
cnf(i_0_15,negated_conjecture,
~ part_of(sum(esk8_0,esk9_0),sum(esk8_0,esk10_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_15) ).
cnf(i_0_40,plain,
( part_of(X1,X2)
| incident_c(esk16_2(X2,X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_40) ).
cnf(i_0_41,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_41) ).
cnf(i_0_45,plain,
( incident_c(X1,X2)
| X2 != sum(X3,X4)
| ~ incident_c(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_45) ).
cnf(i_0_18,negated_conjecture,
part_of(esk9_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_18) ).
cnf(i_0_46,plain,
( incident_c(X1,X2)
| X2 != sum(X3,X4)
| ~ incident_c(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_46) ).
cnf(i_0_39,plain,
( part_of(X1,X2)
| ~ incident_c(esk16_2(X2,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b9aj01wc/lgb.p',i_0_39) ).
cnf(c_0_56,plain,
( incident_c(X1,X2)
| incident_c(X1,X3)
| X4 != sum(X3,X2)
| ~ incident_c(X1,X4) ),
i_0_47 ).
cnf(c_0_57,negated_conjecture,
~ part_of(sum(esk8_0,esk9_0),sum(esk8_0,esk10_0)),
i_0_15 ).
cnf(c_0_58,plain,
( part_of(X1,X2)
| incident_c(esk16_2(X2,X1),X1) ),
i_0_40 ).
cnf(c_0_59,plain,
( incident_c(X1,X2)
| incident_c(X1,X3)
| ~ incident_c(X1,sum(X2,X3)) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_60,negated_conjecture,
incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),sum(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
i_0_41 ).
cnf(c_0_62,negated_conjecture,
( incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk8_0)
| incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk9_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( incident_c(X1,X2)
| X2 != sum(X3,X4)
| ~ incident_c(X1,X4) ),
i_0_45 ).
cnf(c_0_64,plain,
( incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk8_0)
| incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),X1)
| ~ part_of(esk9_0,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
part_of(esk9_0,esk10_0),
i_0_18 ).
cnf(c_0_66,plain,
( incident_c(X1,sum(X2,X3))
| ~ incident_c(X1,X3) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk10_0)
| incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk8_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
( incident_c(X1,X2)
| X2 != sum(X3,X4)
| ~ incident_c(X1,X3) ),
i_0_46 ).
cnf(c_0_69,plain,
( part_of(X1,X2)
| ~ incident_c(esk16_2(X2,X1),X2) ),
i_0_39 ).
cnf(c_0_70,plain,
( incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),sum(X1,esk10_0))
| incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk8_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
( incident_c(X1,sum(X2,X3))
| ~ incident_c(X1,X2) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_72,plain,
incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_57]) ).
cnf(c_0_73,plain,
incident_c(esk16_2(sum(esk8_0,esk10_0),sum(esk8_0,esk9_0)),sum(esk8_0,X1)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_73]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO083+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 18:42:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.13/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.13/2.46 # No SInE strategy applied
% 8.13/2.46 # Trying AutoSched0 for 150 seconds
% 8.13/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.13/2.46 # and selection function SelectCQArNTNpEqFirst.
% 8.13/2.46 #
% 8.13/2.46 # Preprocessing time : 0.023 s
% 8.13/2.46 # Presaturation interreduction done
% 8.13/2.46
% 8.13/2.46 # Proof found!
% 8.13/2.46 # SZS status Theorem
% 8.13/2.46 # SZS output start CNFRefutation
% See solution above
% 8.13/2.46 # Training examples: 0 positive, 0 negative
% 8.13/2.46
% 8.13/2.46 # -------------------------------------------------
% 8.13/2.46 # User time : 0.028 s
% 8.13/2.46 # System time : 0.007 s
% 8.13/2.46 # Total time : 0.035 s
% 8.13/2.46 # Maximum resident set size: 7120 pages
% 8.13/2.46
%------------------------------------------------------------------------------