TSTP Solution File: GEO147+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO147+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:31:36 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 16 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 4 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13,conjecture,
! [X3,X12,X13] :
( connect(X12,X13,X3)
=> ( incident_o(X3,trajectory_of(X12))
& incident_o(X3,trajectory_of(X13)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aJXUMYwaSA/E---3.1_20065.p',t13) ).
fof(at_on_trajectory,axiom,
! [X12,X3] :
( once(at(X12,X3))
<=> incident_o(X3,trajectory_of(X12)) ),
file('/export/starexec/sandbox2/tmp/tmp.aJXUMYwaSA/E---3.1_20065.p',at_on_trajectory) ).
fof(conjunction_at_the_same_time,axiom,
! [X14,X15] :
( once(at_the_same_time(X14,X15))
=> ( once(X14)
& once(X15) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aJXUMYwaSA/E---3.1_20065.p',conjunction_at_the_same_time) ).
fof(connect_defn,axiom,
! [X12,X13,X3] :
( connect(X12,X13,X3)
<=> once(at_the_same_time(at(X12,X3),at(X13,X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.aJXUMYwaSA/E---3.1_20065.p',connect_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X3,X12,X13] :
( connect(X12,X13,X3)
=> ( incident_o(X3,trajectory_of(X12))
& incident_o(X3,trajectory_of(X13)) ) ),
inference(assume_negation,[status(cth)],[t13]) ).
fof(c_0_5,negated_conjecture,
( connect(esk2_0,esk3_0,esk1_0)
& ( ~ incident_o(esk1_0,trajectory_of(esk2_0))
| ~ incident_o(esk1_0,trajectory_of(esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X26,X27] :
( ( ~ once(at(X26,X27))
| incident_o(X27,trajectory_of(X26)) )
& ( ~ incident_o(X27,trajectory_of(X26))
| once(at(X26,X27)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[at_on_trajectory])]) ).
fof(c_0_7,plain,
! [X49,X50] :
( ( once(X49)
| ~ once(at_the_same_time(X49,X50)) )
& ( once(X50)
| ~ once(at_the_same_time(X49,X50)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conjunction_at_the_same_time])])]) ).
fof(c_0_8,plain,
! [X36,X37,X38] :
( ( ~ connect(X36,X37,X38)
| once(at_the_same_time(at(X36,X38),at(X37,X38))) )
& ( ~ once(at_the_same_time(at(X36,X38),at(X37,X38)))
| connect(X36,X37,X38) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connect_defn])]) ).
cnf(c_0_9,negated_conjecture,
( ~ incident_o(esk1_0,trajectory_of(esk2_0))
| ~ incident_o(esk1_0,trajectory_of(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( incident_o(X2,trajectory_of(X1))
| ~ once(at(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( once(X1)
| ~ once(at_the_same_time(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( once(at_the_same_time(at(X1,X3),at(X2,X3)))
| ~ connect(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ once(at(esk3_0,esk1_0))
| ~ incident_o(esk1_0,trajectory_of(esk2_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( once(at(X1,X2))
| ~ connect(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
connect(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( once(X1)
| ~ once(at_the_same_time(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ once(at(esk3_0,esk1_0))
| ~ once(at(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
once(at(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( once(at(X1,X2))
| ~ connect(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ once(at(esk3_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO147+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 06:43:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.aJXUMYwaSA/E---3.1_20065.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 20145 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMF21-MFFFFFNN
% 0.19/0.50 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20147 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMF21-MFFFFFNN
% 0.19/0.50 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 37
% 0.19/0.50 # Removed by relevancy pruning/SinE : 25
% 0.19/0.50 # Initial clauses : 20
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 20
% 0.19/0.50 # Processed clauses : 49
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 2
% 0.19/0.50 # ...remaining for further processing : 47
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 1
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 38
% 0.19/0.50 # ...of the previous two non-redundant : 26
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 36
% 0.19/0.50 # Factorizations : 2
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 1
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 26
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 22
% 0.19/0.50 # Current number of unprocessed clauses: 16
% 0.19/0.50 # ...number of literals in the above : 44
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 21
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 158
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 97
% 0.19/0.50 # Non-unit clause-clause subsumptions : 2
% 0.19/0.50 # Unit Clause-clause subsumption calls : 11
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2190
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.004 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.007 s
% 0.19/0.50 # Maximum resident set size: 1884 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.011 s
% 0.19/0.50 # Maximum resident set size: 1744 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------