TSTP Solution File: LAT394-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT394-1 : TPTP v8.1.2. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 18:11:11 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 3 RR)
% Number of literals : 32 ( 31 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.7Nlxd9snES/E---3.1_510.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox2/tmp/tmp.7Nlxd9snES/E---3.1_510.p',goals) ).
cnf(c_0_2,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
sos ).
cnf(c_0_3,plain,
f(X1,f(f(X1,X2),f(f(f(X1,X2),f(f(f(X3,X1),f(X3,X1)),f(X3,X1))),X4))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
f(f(X1,X2),f(f(f(X1,X2),f(X2,X3)),X2)) = f(f(X1,X2),f(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
f(f(f(f(X1,X2),f(X2,X3)),X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
f(f(X1,X1),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
f(f(X1,X2),f(X1,f(f(X1,f(f(X1,X1),X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
f(X1,f(f(X1,X2),f(X1,X2))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
f(f(X1,X2),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
f(X1,f(f(X1,X1),X2)) = f(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
f(f(X1,X1),f(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_13,plain,
f(f(X1,X2),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_14,plain,
f(f(f(X1,X2),f(X1,X2)),X1) = f(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,plain,
f(f(X1,X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,plain,
f(f(X1,X2),f(X2,f(f(X1,X1),X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_17,plain,
f(f(X1,X1),f(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
f(X1,f(f(X1,X2),f(X1,f(X1,X1)))) = f(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_9]) ).
cnf(c_0_19,plain,
f(X1,f(X2,f(X1,X1))) = f(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
f(f(X1,X2),f(X1,f(f(X3,X3),X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_18]),c_0_19]),c_0_15]) ).
cnf(c_0_21,plain,
f(X1,f(f(X2,X1),f(X2,X1))) = f(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_10]),c_0_10]) ).
cnf(c_0_22,plain,
f(X1,X1) = f(X1,f(f(X2,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
f(X1,f(f(X2,X1),f(X1,f(X1,X1)))) = f(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]) ).
cnf(c_0_24,plain,
f(f(f(X1,X1),X1),X2) = f(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6]) ).
cnf(c_0_25,plain,
f(f(X1,X1),X1) = f(X1,f(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_8]) ).
cnf(c_0_26,plain,
f(f(X1,f(X2,X2)),X2) = f(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_27,plain,
f(f(X1,f(X2,f(X2,X2))),f(X3,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_25]) ).
cnf(c_0_28,plain,
f(f(X1,X2),f(X2,f(X3,f(X3,X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
goals ).
cnf(c_0_30,plain,
f(X1,f(X1,X1)) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT394-1 : TPTP v8.1.2. Released v5.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 10:11:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.7Nlxd9snES/E---3.1_510.p
% 0.20/0.59 # Version: 3.1pre001
% 0.20/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # new_bool_1 with pid 682 completed with status 0
% 0.20/0.59 # Result found by new_bool_1
% 0.20/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.59 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 687 completed with status 0
% 0.20/0.59 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.59 # Preprocessing time : 0.001 s
% 0.20/0.59 # Presaturation interreduction done
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Unsatisfiable
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 5
% 0.20/0.59 # Removed by relevancy pruning/SinE : 3
% 0.20/0.59 # Initial clauses : 2
% 0.20/0.59 # Removed in clause preprocessing : 0
% 0.20/0.59 # Initial clauses in saturation : 2
% 0.20/0.59 # Processed clauses : 211
% 0.20/0.59 # ...of these trivial : 102
% 0.20/0.59 # ...subsumed : 36
% 0.20/0.59 # ...remaining for further processing : 73
% 0.20/0.59 # Other redundant clauses eliminated : 0
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 0
% 0.20/0.59 # Backward-rewritten : 16
% 0.20/0.59 # Generated clauses : 9279
% 0.20/0.59 # ...of the previous two non-redundant : 3363
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 0
% 0.20/0.59 # Paramodulations : 9278
% 0.20/0.59 # Factorizations : 0
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 0
% 0.20/0.59 # Total rewrite steps : 9925
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 54
% 0.20/0.59 # Positive orientable unit clauses : 51
% 0.20/0.59 # Positive unorientable unit clauses: 3
% 0.20/0.59 # Negative unit clauses : 0
% 0.20/0.59 # Non-unit-clauses : 0
% 0.20/0.59 # Current number of unprocessed clauses: 3080
% 0.20/0.59 # ...number of literals in the above : 3080
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 19
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.59 # Non-unit clause-clause subsumptions : 0
% 0.20/0.59 # Unit Clause-clause subsumption calls : 219
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 1189
% 0.20/0.59 # BW rewrite match successes : 55
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 105819
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.082 s
% 0.20/0.59 # System time : 0.003 s
% 0.20/0.59 # Total time : 0.085 s
% 0.20/0.59 # Maximum resident set size: 1424 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.084 s
% 0.20/0.59 # System time : 0.005 s
% 0.20/0.59 # Total time : 0.089 s
% 0.20/0.59 # Maximum resident set size: 1680 pages
% 0.20/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------