TSTP Solution File: GEO060-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO060-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:33:37 EDT 2023
% Result : Unsatisfiable 65.07s 8.73s
% Output : CNFRefutation 65.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of clauses : 37 ( 22 unt; 8 nHn; 15 RR)
% Number of literals : 76 ( 18 equ; 33 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 114 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_for_equidistance,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',reflexivity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',segment_construction2) ).
cnf(reflection,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',reflection) ).
cnf(outer_five_segment,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',outer_five_segment) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',segment_construction1) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',identity_for_equidistance) ).
cnf(prove__involution,negated_conjecture,
u != reflection(reflection(u,v),v),
file('/export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p',prove__involution) ).
cnf(c_0_8,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_9,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_10,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_11,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
reflection ).
cnf(c_0_12,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
equidistant(X1,reflection(X2,X1),X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
equidistant(X1,X2,reflection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
equidistant(reflection(X1,X2),X2,X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,plain,
equidistant(X1,X2,X1,reflection(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
outer_five_segment ).
cnf(c_0_20,plain,
equidistant(X1,reflection(X2,X1),X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( X1 = X2
| equidistant(X3,reflection(X4,X2),X5,X4)
| ~ between(X6,X2,X5)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,reflection(X4,X2),X6,X4)
| ~ equidistant(X2,X3,X2,X5)
| ~ equidistant(X1,X2,X6,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_23,plain,
( X1 = X2
| equidistant(X3,reflection(X1,X2),X4,X1)
| ~ between(reflection(X1,X2),X2,X4)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_9]),c_0_14])]) ).
cnf(c_0_24,plain,
between(X1,X2,reflection(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_25,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_26,plain,
( X1 = X2
| equidistant(X3,reflection(X1,X2),reflection(reflection(X1,X2),X2),X1)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X2,reflection(reflection(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_28,plain,
( equidistant(X1,X2,extension(X3,X4,X5,X6),X4)
| ~ equidistant(X5,X6,X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_29,plain,
( X1 = X2
| equidistant(reflection(X1,X2),reflection(X1,X2),reflection(reflection(X1,X2),X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_24])]) ).
cnf(c_0_30,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_27,c_0_10]) ).
cnf(c_0_31,plain,
( X1 = X2
| equidistant(reflection(reflection(X1,X2),X2),X1,X3,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
u != reflection(reflection(u,v),v),
prove__involution ).
cnf(c_0_33,plain,
( reflection(reflection(X1,X2),X2) = X1
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
v = u,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
reflection(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_34]),c_0_35]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO060-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n007.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 2400
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Oct 3 06:05:40 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.NmBDZjJLXL/E---3.1_6518.p
% 65.07/8.73 # Version: 3.1pre001
% 65.07/8.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.07/8.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.07/8.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.07/8.73 # Starting new_bool_3 with 300s (1) cores
% 65.07/8.73 # Starting new_bool_1 with 300s (1) cores
% 65.07/8.73 # Starting sh5l with 300s (1) cores
% 65.07/8.73 # new_bool_1 with pid 6651 completed with status 0
% 65.07/8.73 # Result found by new_bool_1
% 65.07/8.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.07/8.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.07/8.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.07/8.73 # Starting new_bool_3 with 300s (1) cores
% 65.07/8.73 # Starting new_bool_1 with 300s (1) cores
% 65.07/8.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.07/8.73 # Search class: FGUSM-FFSF33-SFFFFFNN
% 65.07/8.73 # partial match(1): FGUSM-FFMF33-SFFFFFNN
% 65.07/8.73 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 65.07/8.73 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 65.07/8.73 # G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 6659 completed with status 0
% 65.07/8.73 # Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 65.07/8.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.07/8.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.07/8.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.07/8.73 # Starting new_bool_3 with 300s (1) cores
% 65.07/8.73 # Starting new_bool_1 with 300s (1) cores
% 65.07/8.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.07/8.73 # Search class: FGUSM-FFSF33-SFFFFFNN
% 65.07/8.73 # partial match(1): FGUSM-FFMF33-SFFFFFNN
% 65.07/8.73 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 65.07/8.73 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 65.07/8.73 # Preprocessing time : 0.001 s
% 65.07/8.73 # Presaturation interreduction done
% 65.07/8.73
% 65.07/8.73 # Proof found!
% 65.07/8.73 # SZS status Unsatisfiable
% 65.07/8.73 # SZS output start CNFRefutation
% See solution above
% 65.07/8.73 # Parsed axioms : 20
% 65.07/8.73 # Removed by relevancy pruning/SinE : 10
% 65.07/8.73 # Initial clauses : 10
% 65.07/8.73 # Removed in clause preprocessing : 0
% 65.07/8.73 # Initial clauses in saturation : 10
% 65.07/8.73 # Processed clauses : 19092
% 65.07/8.73 # ...of these trivial : 13963
% 65.07/8.73 # ...subsumed : 2100
% 65.07/8.73 # ...remaining for further processing : 3029
% 65.07/8.73 # Other redundant clauses eliminated : 0
% 65.07/8.73 # Clauses deleted for lack of memory : 0
% 65.07/8.73 # Backward-subsumed : 0
% 65.07/8.73 # Backward-rewritten : 4
% 65.07/8.73 # Generated clauses : 912721
% 65.07/8.73 # ...of the previous two non-redundant : 840514
% 65.07/8.73 # ...aggressively subsumed : 0
% 65.07/8.73 # Contextual simplify-reflections : 0
% 65.07/8.73 # Paramodulations : 912721
% 65.07/8.73 # Factorizations : 0
% 65.07/8.73 # NegExts : 0
% 65.07/8.73 # Equation resolutions : 0
% 65.07/8.73 # Total rewrite steps : 295387
% 65.07/8.73 # Propositional unsat checks : 0
% 65.07/8.73 # Propositional check models : 0
% 65.07/8.73 # Propositional check unsatisfiable : 0
% 65.07/8.73 # Propositional clauses : 0
% 65.07/8.73 # Propositional clauses after purity: 0
% 65.07/8.73 # Propositional unsat core size : 0
% 65.07/8.73 # Propositional preprocessing time : 0.000
% 65.07/8.73 # Propositional encoding time : 0.000
% 65.07/8.73 # Propositional solver time : 0.000
% 65.07/8.73 # Success case prop preproc time : 0.000
% 65.07/8.73 # Success case prop encoding time : 0.000
% 65.07/8.73 # Success case prop solver time : 0.000
% 65.07/8.73 # Current number of processed clauses : 3015
% 65.07/8.73 # Positive orientable unit clauses : 1459
% 65.07/8.73 # Positive unorientable unit clauses: 0
% 65.07/8.73 # Negative unit clauses : 0
% 65.07/8.73 # Non-unit-clauses : 1556
% 65.07/8.73 # Current number of unprocessed clauses: 821442
% 65.07/8.73 # ...number of literals in the above : 997131
% 65.07/8.73 # Current number of archived formulas : 0
% 65.07/8.73 # Current number of archived clauses : 14
% 65.07/8.73 # Clause-clause subsumption calls (NU) : 1182726
% 65.07/8.73 # Rec. Clause-clause subsumption calls : 269477
% 65.07/8.73 # Non-unit clause-clause subsumptions : 2100
% 65.07/8.73 # Unit Clause-clause subsumption calls : 16761
% 65.07/8.73 # Rewrite failures with RHS unbound : 0
% 65.07/8.73 # BW rewrite match attempts : 672826
% 65.07/8.73 # BW rewrite match successes : 4
% 65.07/8.73 # Condensation attempts : 0
% 65.07/8.73 # Condensation successes : 0
% 65.07/8.73 # Termbank termtop insertions : 20670558
% 65.07/8.73
% 65.07/8.73 # -------------------------------------------------
% 65.07/8.73 # User time : 7.737 s
% 65.07/8.73 # System time : 0.288 s
% 65.07/8.73 # Total time : 8.025 s
% 65.07/8.73 # Maximum resident set size: 1632 pages
% 65.07/8.73
% 65.07/8.73 # -------------------------------------------------
% 65.07/8.73 # User time : 7.738 s
% 65.07/8.73 # System time : 0.291 s
% 65.07/8.73 # Total time : 8.028 s
% 65.07/8.73 # Maximum resident set size: 1692 pages
% 65.07/8.73 % E---3.1 exiting
%------------------------------------------------------------------------------