TSTP Solution File: SYN083+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN083+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 20:29:14 EDT 2023
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel61,conjecture,
! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
file('/export/starexec/sandbox/tmp/tmp.WI2Kd3cbm8/E---3.1_19306.p',pel61) ).
fof(p61_1,axiom,
! [X1,X2,X3] : f(X1,f(X2,X3)) = f(f(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.WI2Kd3cbm8/E---3.1_19306.p',p61_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
inference(assume_negation,[status(cth)],[pel61]) ).
fof(c_0_3,negated_conjecture,
f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X9,X10,X11] : f(X9,f(X10,X11)) = f(f(X9,X10),X11),
inference(variable_rename,[status(thm)],[p61_1]) ).
cnf(c_0_5,negated_conjecture,
f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
f(X1,f(X2,X3)) = f(f(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SYN083+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 18:54:19 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.37 Running first-order model finding
% 0.13/0.37 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.WI2Kd3cbm8/E---3.1_19306.p
% 0.13/0.38 # Version: 3.1pre001
% 0.13/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.38 # Starting sh5l with 300s (1) cores
% 0.13/0.38 # new_bool_3 with pid 19554 completed with status 0
% 0.13/0.38 # Result found by new_bool_3
% 0.13/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.13/0.38 # G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with pid 19561 completed with status 0
% 0.13/0.38 # Result found by G-E--_209_C18_F1_AE_CS_SP_PI_S0Y
% 0.13/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.13/0.38 # Preprocessing time : 0.001 s
% 0.13/0.38
% 0.13/0.38 # Proof found!
% 0.13/0.38 # SZS status Theorem
% 0.13/0.38 # SZS output start CNFRefutation
% See solution above
% 0.13/0.38 # Parsed axioms : 2
% 0.13/0.38 # Removed by relevancy pruning/SinE : 0
% 0.13/0.38 # Initial clauses : 2
% 0.13/0.38 # Removed in clause preprocessing : 0
% 0.13/0.38 # Initial clauses in saturation : 2
% 0.13/0.38 # Processed clauses : 2
% 0.13/0.38 # ...of these trivial : 0
% 0.13/0.38 # ...subsumed : 0
% 0.13/0.38 # ...remaining for further processing : 1
% 0.13/0.38 # Other redundant clauses eliminated : 0
% 0.13/0.38 # Clauses deleted for lack of memory : 0
% 0.13/0.38 # Backward-subsumed : 0
% 0.13/0.38 # Backward-rewritten : 0
% 0.13/0.38 # Generated clauses : 1
% 0.13/0.38 # ...of the previous two non-redundant : 0
% 0.13/0.38 # ...aggressively subsumed : 0
% 0.13/0.38 # Contextual simplify-reflections : 0
% 0.13/0.38 # Paramodulations : 1
% 0.13/0.38 # Factorizations : 0
% 0.13/0.38 # NegExts : 0
% 0.13/0.38 # Equation resolutions : 0
% 0.13/0.38 # Total rewrite steps : 6
% 0.13/0.38 # Propositional unsat checks : 0
% 0.13/0.38 # Propositional check models : 0
% 0.13/0.38 # Propositional check unsatisfiable : 0
% 0.13/0.38 # Propositional clauses : 0
% 0.13/0.38 # Propositional clauses after purity: 0
% 0.13/0.38 # Propositional unsat core size : 0
% 0.13/0.38 # Propositional preprocessing time : 0.000
% 0.13/0.38 # Propositional encoding time : 0.000
% 0.13/0.38 # Propositional solver time : 0.000
% 0.13/0.38 # Success case prop preproc time : 0.000
% 0.13/0.38 # Success case prop encoding time : 0.000
% 0.13/0.38 # Success case prop solver time : 0.000
% 0.13/0.38 # Current number of processed clauses : 1
% 0.13/0.38 # Positive orientable unit clauses : 1
% 0.13/0.38 # Positive unorientable unit clauses: 0
% 0.13/0.38 # Negative unit clauses : 0
% 0.13/0.38 # Non-unit-clauses : 0
% 0.13/0.38 # Current number of unprocessed clauses: 0
% 0.13/0.38 # ...number of literals in the above : 0
% 0.13/0.38 # Current number of archived formulas : 0
% 0.13/0.38 # Current number of archived clauses : 0
% 0.13/0.38 # Clause-clause subsumption calls (NU) : 0
% 0.13/0.38 # Rec. Clause-clause subsumption calls : 0
% 0.13/0.38 # Non-unit clause-clause subsumptions : 0
% 0.13/0.38 # Unit Clause-clause subsumption calls : 0
% 0.13/0.38 # Rewrite failures with RHS unbound : 0
% 0.13/0.38 # BW rewrite match attempts : 0
% 0.13/0.38 # BW rewrite match successes : 0
% 0.13/0.38 # Condensation attempts : 0
% 0.13/0.38 # Condensation successes : 0
% 0.13/0.38 # Termbank termtop insertions : 161
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.002 s
% 0.13/0.38 # System time : 0.000 s
% 0.13/0.38 # Total time : 0.002 s
% 0.13/0.38 # Maximum resident set size: 1620 pages
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.002 s
% 0.13/0.38 # System time : 0.002 s
% 0.13/0.38 # Total time : 0.004 s
% 0.13/0.38 # Maximum resident set size: 1664 pages
% 0.13/0.38 % E---3.1 exiting
%------------------------------------------------------------------------------