TSTP Solution File: LAT394-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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:09:08 EDT 2023
% Result : Unsatisfiable 1.11s 0.60s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 3 RR)
% Number of literals : 34 ( 33 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 : 75 ( 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/sandbox/tmp/tmp.tZkzwTS4uh/E---3.1_470.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox/tmp/tmp.tZkzwTS4uh/E---3.1_470.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(X1,f(f(X1,f(f(X1,X1),X2)),f(X1,X1))) = f(X1,f(f(X1,X1),X2)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,plain,
f(f(X1,X2),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,plain,
f(X1,f(f(X1,X1),X2)) = f(X1,X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
f(f(X1,X1),f(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_11]),c_0_11]) ).
cnf(c_0_13,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_14,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_15,plain,
f(f(f(X1,X2),f(X1,X2)),X1) = f(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,plain,
f(f(X1,X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_17,plain,
f(f(X1,X2),f(X2,f(f(X1,X1),X1))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_18,plain,
f(f(X1,X1),f(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,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_17,c_0_12]),c_0_10]) ).
cnf(c_0_20,plain,
f(X1,f(X2,f(X1,X1))) = f(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_21,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_19]),c_0_20]),c_0_16]) ).
cnf(c_0_22,plain,
f(X1,f(f(X1,f(f(X2,X1),X3)),f(X2,X1))) = f(X1,f(f(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_4,c_0_18]) ).
cnf(c_0_23,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_16]),c_0_11]),c_0_11]) ).
cnf(c_0_24,plain,
f(X1,X1) = f(X1,f(f(X2,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_21]) ).
cnf(c_0_25,plain,
f(X1,f(f(X1,X2),f(X2,X1))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_26,plain,
f(f(f(X1,X1),X1),X2) = f(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_6]) ).
cnf(c_0_27,plain,
f(f(X1,X1),X1) = f(X1,f(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]) ).
cnf(c_0_28,plain,
f(f(X1,f(X2,X2)),X2) = f(X2,X2),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_29,plain,
f(f(X1,f(X2,f(X2,X2))),f(X3,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_27]) ).
cnf(c_0_30,plain,
f(f(X1,X2),f(X2,f(X3,f(X3,X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
goals ).
cnf(c_0_32,plain,
f(X1,f(X1,X1)) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LAT394-1 : TPTP v8.1.2. Released v5.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 10:11:37 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.tZkzwTS4uh/E---3.1_470.p
% 1.11/0.60 # Version: 3.1pre001
% 1.11/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.11/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.11/0.60 # Starting new_bool_3 with 300s (1) cores
% 1.11/0.60 # Starting new_bool_1 with 300s (1) cores
% 1.11/0.60 # Starting sh5l with 300s (1) cores
% 1.11/0.60 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 631 completed with status 0
% 1.11/0.60 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.11/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.11/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.11/0.60 # No SInE strategy applied
% 1.11/0.60 # Search class: FUUPF-FFSF22-DFFFFFNN
% 1.11/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.11/0.60 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.11/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.11/0.60 # Starting new_bool_3 with 136s (1) cores
% 1.11/0.60 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.11/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.11/0.60 # G----_0015_C18_F1_SE_CS_SP_S0Y with pid 643 completed with status 0
% 1.11/0.60 # Result found by G----_0015_C18_F1_SE_CS_SP_S0Y
% 1.11/0.60 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.11/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.11/0.60 # No SInE strategy applied
% 1.11/0.60 # Search class: FUUPF-FFSF22-DFFFFFNN
% 1.11/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.11/0.60 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.11/0.60 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.11/0.60 # Starting new_bool_3 with 136s (1) cores
% 1.11/0.60 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.11/0.60 # Preprocessing time : 0.001 s
% 1.11/0.60
% 1.11/0.60 # Proof found!
% 1.11/0.60 # SZS status Unsatisfiable
% 1.11/0.60 # SZS output start CNFRefutation
% See solution above
% 1.11/0.60 # Parsed axioms : 5
% 1.11/0.60 # Removed by relevancy pruning/SinE : 0
% 1.11/0.60 # Initial clauses : 5
% 1.11/0.60 # Removed in clause preprocessing : 3
% 1.11/0.60 # Initial clauses in saturation : 2
% 1.11/0.60 # Processed clauses : 222
% 1.11/0.60 # ...of these trivial : 104
% 1.11/0.60 # ...subsumed : 51
% 1.11/0.60 # ...remaining for further processing : 67
% 1.11/0.60 # Other redundant clauses eliminated : 0
% 1.11/0.60 # Clauses deleted for lack of memory : 0
% 1.11/0.60 # Backward-subsumed : 0
% 1.11/0.60 # Backward-rewritten : 13
% 1.11/0.60 # Generated clauses : 8453
% 1.11/0.60 # ...of the previous two non-redundant : 3053
% 1.11/0.60 # ...aggressively subsumed : 0
% 1.11/0.60 # Contextual simplify-reflections : 0
% 1.11/0.60 # Paramodulations : 8452
% 1.11/0.60 # Factorizations : 0
% 1.11/0.60 # NegExts : 0
% 1.11/0.60 # Equation resolutions : 0
% 1.11/0.60 # Total rewrite steps : 8995
% 1.11/0.60 # Propositional unsat checks : 0
% 1.11/0.60 # Propositional check models : 0
% 1.11/0.60 # Propositional check unsatisfiable : 0
% 1.11/0.60 # Propositional clauses : 0
% 1.11/0.60 # Propositional clauses after purity: 0
% 1.11/0.60 # Propositional unsat core size : 0
% 1.11/0.60 # Propositional preprocessing time : 0.000
% 1.11/0.60 # Propositional encoding time : 0.000
% 1.11/0.60 # Propositional solver time : 0.000
% 1.11/0.60 # Success case prop preproc time : 0.000
% 1.11/0.60 # Success case prop encoding time : 0.000
% 1.11/0.60 # Success case prop solver time : 0.000
% 1.11/0.60 # Current number of processed clauses : 53
% 1.11/0.60 # Positive orientable unit clauses : 50
% 1.11/0.60 # Positive unorientable unit clauses: 3
% 1.11/0.60 # Negative unit clauses : 0
% 1.11/0.60 # Non-unit-clauses : 0
% 1.11/0.60 # Current number of unprocessed clauses: 2783
% 1.11/0.60 # ...number of literals in the above : 2783
% 1.11/0.60 # Current number of archived formulas : 0
% 1.11/0.60 # Current number of archived clauses : 17
% 1.11/0.60 # Clause-clause subsumption calls (NU) : 0
% 1.11/0.60 # Rec. Clause-clause subsumption calls : 0
% 1.11/0.60 # Non-unit clause-clause subsumptions : 0
% 1.11/0.60 # Unit Clause-clause subsumption calls : 220
% 1.11/0.60 # Rewrite failures with RHS unbound : 70
% 1.11/0.60 # BW rewrite match attempts : 1104
% 1.11/0.60 # BW rewrite match successes : 52
% 1.11/0.60 # Condensation attempts : 0
% 1.11/0.60 # Condensation successes : 0
% 1.11/0.60 # Termbank termtop insertions : 95708
% 1.11/0.60
% 1.11/0.60 # -------------------------------------------------
% 1.11/0.60 # User time : 0.094 s
% 1.11/0.60 # System time : 0.008 s
% 1.11/0.60 # Total time : 0.101 s
% 1.11/0.60 # Maximum resident set size: 1520 pages
% 1.11/0.60
% 1.11/0.60 # -------------------------------------------------
% 1.11/0.60 # User time : 0.451 s
% 1.11/0.60 # System time : 0.031 s
% 1.11/0.60 # Total time : 0.482 s
% 1.11/0.60 # Maximum resident set size: 1684 pages
% 1.11/0.60 % E---3.1 exiting
% 1.11/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------