TSTP Solution File: LAT037-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT037-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:07:27 EDT 2023
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 39 unt; 0 nHn; 18 RR)
% Number of literals : 47 ( 46 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',associativity_of_join) ).
cnf(lhs2,axiom,
join(xx,zz) = n1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',lhs2) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',commutativity_of_join) ).
cnf(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',x_meet_1) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',commutativity_of_meet) ).
cnf(lhs4,axiom,
meet(xx,zz) = n0,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',lhs4) ).
cnf(lhs3,axiom,
meet(xx,yy) = n0,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',lhs3) ).
cnf(modular,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',modular) ).
cnf(x_join_1,axiom,
join(X1,n1) = n1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',x_join_1) ).
cnf(dist_meet,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',dist_meet) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',x_join_0) ).
cnf(lhs1,axiom,
join(xx,yy) = n1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',lhs1) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',idempotence_of_meet) ).
cnf(rhs,negated_conjecture,
yy != zz,
file('/export/starexec/sandbox/tmp/tmp.1F8LxoHwtK/E---3.1_1869.p',rhs) ).
cnf(c_0_15,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,axiom,
join(xx,zz) = n1,
lhs2 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_19,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_20,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_21,axiom,
meet(xx,zz) = n0,
lhs4 ).
cnf(c_0_22,axiom,
meet(xx,yy) = n0,
lhs3 ).
cnf(c_0_23,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
join(zz,xx) = n1,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
modular ).
cnf(c_0_27,axiom,
join(X1,n1) = n1,
x_join_1 ).
cnf(c_0_28,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
dist_meet ).
cnf(c_0_29,plain,
meet(zz,xx) = n0,
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_30,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_31,axiom,
join(xx,yy) = n1,
lhs1 ).
cnf(c_0_32,plain,
meet(yy,xx) = n0,
inference(rw,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_33,plain,
join(zz,join(xx,X1)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_34,plain,
( join(X1,X2) = X2
| meet(X1,X2) != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27]),c_0_19]) ).
cnf(c_0_35,hypothesis,
meet(zz,join(X1,xx)) = meet(zz,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
join(yy,xx) = n1,
inference(rw,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_37,hypothesis,
meet(yy,join(X1,xx)) = meet(yy,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_30]) ).
cnf(c_0_38,plain,
( join(zz,X1) = n1
| meet(xx,X1) != xx ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
meet(yy,zz) = zz,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_19]),c_0_20]) ).
cnf(c_0_40,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_41,negated_conjecture,
yy != zz,
rhs ).
cnf(c_0_42,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19]),c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT037-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 10:52:34 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.1F8LxoHwtK/E---3.1_1869.p
% 0.17/0.50 # Version: 3.1pre001
% 0.17/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # sh5l with pid 1952 completed with status 0
% 0.17/0.50 # Result found by sh5l
% 0.17/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.50 # Search class: FHUPM-FFSS22-SFFFFFNN
% 0.17/0.50 # partial match(1): FHUSM-FFSS22-SFFFFFNN
% 0.17/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.50 # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1958 completed with status 0
% 0.17/0.50 # Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.50 # Search class: FHUPM-FFSS22-SFFFFFNN
% 0.17/0.50 # partial match(1): FHUSM-FFSS22-SFFFFFNN
% 0.17/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.50 # Preprocessing time : 0.001 s
% 0.17/0.50 # Presaturation interreduction done
% 0.17/0.50
% 0.17/0.50 # Proof found!
% 0.17/0.50 # SZS status Unsatisfiable
% 0.17/0.50 # SZS output start CNFRefutation
% See solution above
% 0.17/0.50 # Parsed axioms : 20
% 0.17/0.50 # Removed by relevancy pruning/SinE : 0
% 0.17/0.50 # Initial clauses : 20
% 0.17/0.50 # Removed in clause preprocessing : 0
% 0.17/0.50 # Initial clauses in saturation : 20
% 0.17/0.50 # Processed clauses : 545
% 0.17/0.50 # ...of these trivial : 58
% 0.17/0.50 # ...subsumed : 333
% 0.17/0.50 # ...remaining for further processing : 154
% 0.17/0.50 # Other redundant clauses eliminated : 29
% 0.17/0.50 # Clauses deleted for lack of memory : 0
% 0.17/0.50 # Backward-subsumed : 18
% 0.17/0.50 # Backward-rewritten : 5
% 0.17/0.50 # Generated clauses : 3528
% 0.17/0.50 # ...of the previous two non-redundant : 2480
% 0.17/0.50 # ...aggressively subsumed : 0
% 0.17/0.50 # Contextual simplify-reflections : 2
% 0.17/0.50 # Paramodulations : 3499
% 0.17/0.50 # Factorizations : 0
% 0.17/0.50 # NegExts : 0
% 0.17/0.50 # Equation resolutions : 29
% 0.17/0.50 # Total rewrite steps : 3361
% 0.17/0.50 # Propositional unsat checks : 0
% 0.17/0.50 # Propositional check models : 0
% 0.17/0.50 # Propositional check unsatisfiable : 0
% 0.17/0.50 # Propositional clauses : 0
% 0.17/0.50 # Propositional clauses after purity: 0
% 0.17/0.50 # Propositional unsat core size : 0
% 0.17/0.50 # Propositional preprocessing time : 0.000
% 0.17/0.50 # Propositional encoding time : 0.000
% 0.17/0.50 # Propositional solver time : 0.000
% 0.17/0.50 # Success case prop preproc time : 0.000
% 0.17/0.50 # Success case prop encoding time : 0.000
% 0.17/0.50 # Success case prop solver time : 0.000
% 0.17/0.50 # Current number of processed clauses : 111
% 0.17/0.50 # Positive orientable unit clauses : 48
% 0.17/0.50 # Positive unorientable unit clauses: 6
% 0.17/0.50 # Negative unit clauses : 7
% 0.17/0.50 # Non-unit-clauses : 50
% 0.17/0.50 # Current number of unprocessed clauses: 1890
% 0.17/0.50 # ...number of literals in the above : 3361
% 0.17/0.50 # Current number of archived formulas : 0
% 0.17/0.50 # Current number of archived clauses : 43
% 0.17/0.50 # Clause-clause subsumption calls (NU) : 880
% 0.17/0.50 # Rec. Clause-clause subsumption calls : 781
% 0.17/0.50 # Non-unit clause-clause subsumptions : 176
% 0.17/0.50 # Unit Clause-clause subsumption calls : 97
% 0.17/0.50 # Rewrite failures with RHS unbound : 0
% 0.17/0.50 # BW rewrite match attempts : 180
% 0.17/0.50 # BW rewrite match successes : 137
% 0.17/0.50 # Condensation attempts : 0
% 0.17/0.50 # Condensation successes : 0
% 0.17/0.50 # Termbank termtop insertions : 26356
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.038 s
% 0.17/0.50 # System time : 0.000 s
% 0.17/0.50 # Total time : 0.038 s
% 0.17/0.50 # Maximum resident set size: 1656 pages
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.038 s
% 0.17/0.50 # System time : 0.003 s
% 0.17/0.50 # Total time : 0.041 s
% 0.17/0.50 # Maximum resident set size: 1676 pages
% 0.17/0.50 % E---3.1 exiting
% 0.17/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------