TSTP Solution File: LAT027-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT027-1 : TPTP v8.1.2. Released v2.2.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:15:42 EDT 2024
% Result : Unsatisfiable 0.99s 0.61s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 34 ( 33 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 81 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_2,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.Ka3cnQ5lEv/E---3.1_30819.p',wal_2) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Ka3cnQ5lEv/E---3.1_30819.p',commutativity_of_join) ).
cnf(absorption,hypothesis,
meet(X1,join(X2,join(X1,X3))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Ka3cnQ5lEv/E---3.1_30819.p',absorption) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Ka3cnQ5lEv/E---3.1_30819.p',idempotence_of_join) ).
cnf(prove_associativity_of_join,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
file('/export/starexec/sandbox2/tmp/tmp.Ka3cnQ5lEv/E---3.1_30819.p',prove_associativity_of_join) ).
cnf(c_0_5,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
wal_2 ).
cnf(c_0_6,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_7,plain,
join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
meet(X1,join(X2,join(X1,X3))) = X1,
absorption ).
cnf(c_0_9,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_10,hypothesis,
join(join(X1,join(X2,X3)),join(X2,meet(X4,join(X1,join(X2,X3))))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).
cnf(c_0_11,hypothesis,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_13,hypothesis,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,hypothesis,
join(join(X1,X2),join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_6]) ).
cnf(c_0_15,hypothesis,
join(join(X1,join(X2,X3)),join(X3,meet(X4,join(X1,join(X2,X3))))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,hypothesis,
join(join(X1,X2),join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,hypothesis,
meet(X1,join(join(X2,X1),X3)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_18,hypothesis,
join(join(X1,X2),join(X1,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_19,hypothesis,
meet(join(X1,X2),join(X2,join(X1,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_20,hypothesis,
join(join(X1,X2),join(X2,join(X3,X1))) = join(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_6]) ).
cnf(c_0_21,hypothesis,
join(join(X1,X2),join(join(X3,X2),X1)) = join(join(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_6]) ).
cnf(c_0_22,hypothesis,
join(join(X1,X2),join(X1,join(X3,X2))) = join(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_6]) ).
cnf(c_0_23,hypothesis,
join(join(X1,X2),join(X1,X3)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_join]) ).
cnf(c_0_25,hypothesis,
join(join(X1,X2),join(join(X3,X1),X2)) = join(join(X3,X1),X2),
inference(spm,[status(thm)],[c_0_21,c_0_6]) ).
cnf(c_0_26,hypothesis,
join(join(X1,X2),join(X3,X2)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
join(join(X1,X2),join(X1,join(X2,X3))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_6]) ).
cnf(c_0_28,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
c_0_24 ).
cnf(c_0_29,hypothesis,
join(join(X1,X2),join(X2,X3)) = join(join(X1,X2),X3),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
join(join(X1,X2),join(X3,X1)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
join(c,join(a,b)) != join(a,join(b,c)),
inference(rw,[status(thm)],[c_0_28,c_0_6]) ).
cnf(c_0_32,hypothesis,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT027-1 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 08:08:17 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.Ka3cnQ5lEv/E---3.1_30819.p
% 0.99/0.61 # Version: 3.1.0
% 0.99/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.61 # Starting sh5l with 300s (1) cores
% 0.99/0.61 # new_bool_1 with pid 30960 completed with status 0
% 0.99/0.61 # Result found by new_bool_1
% 0.99/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.61 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.99/0.61 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.61 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.99/0.61 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 30966 completed with status 0
% 0.99/0.61 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.99/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.61 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.99/0.61 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.61 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.99/0.61 # Preprocessing time : 0.001 s
% 0.99/0.61 # Presaturation interreduction done
% 0.99/0.61
% 0.99/0.61 # Proof found!
% 0.99/0.61 # SZS status Unsatisfiable
% 0.99/0.61 # SZS output start CNFRefutation
% See solution above
% 0.99/0.61 # Parsed axioms : 8
% 0.99/0.61 # Removed by relevancy pruning/SinE : 0
% 0.99/0.61 # Initial clauses : 8
% 0.99/0.61 # Removed in clause preprocessing : 0
% 0.99/0.61 # Initial clauses in saturation : 8
% 0.99/0.61 # Processed clauses : 591
% 0.99/0.61 # ...of these trivial : 295
% 0.99/0.61 # ...subsumed : 170
% 0.99/0.61 # ...remaining for further processing : 126
% 0.99/0.61 # Other redundant clauses eliminated : 0
% 0.99/0.61 # Clauses deleted for lack of memory : 0
% 0.99/0.61 # Backward-subsumed : 0
% 0.99/0.61 # Backward-rewritten : 53
% 0.99/0.61 # Generated clauses : 16863
% 0.99/0.61 # ...of the previous two non-redundant : 7751
% 0.99/0.61 # ...aggressively subsumed : 0
% 0.99/0.61 # Contextual simplify-reflections : 0
% 0.99/0.61 # Paramodulations : 16863
% 0.99/0.61 # Factorizations : 0
% 0.99/0.61 # NegExts : 0
% 0.99/0.61 # Equation resolutions : 0
% 0.99/0.61 # Disequality decompositions : 0
% 0.99/0.61 # Total rewrite steps : 14777
% 0.99/0.61 # ...of those cached : 12156
% 0.99/0.61 # Propositional unsat checks : 0
% 0.99/0.61 # Propositional check models : 0
% 0.99/0.61 # Propositional check unsatisfiable : 0
% 0.99/0.61 # Propositional clauses : 0
% 0.99/0.61 # Propositional clauses after purity: 0
% 0.99/0.61 # Propositional unsat core size : 0
% 0.99/0.61 # Propositional preprocessing time : 0.000
% 0.99/0.61 # Propositional encoding time : 0.000
% 0.99/0.61 # Propositional solver time : 0.000
% 0.99/0.61 # Success case prop preproc time : 0.000
% 0.99/0.61 # Success case prop encoding time : 0.000
% 0.99/0.61 # Success case prop solver time : 0.000
% 0.99/0.61 # Current number of processed clauses : 65
% 0.99/0.61 # Positive orientable unit clauses : 62
% 0.99/0.61 # Positive unorientable unit clauses: 3
% 0.99/0.61 # Negative unit clauses : 0
% 0.99/0.61 # Non-unit-clauses : 0
% 0.99/0.61 # Current number of unprocessed clauses: 7155
% 0.99/0.61 # ...number of literals in the above : 7155
% 0.99/0.61 # Current number of archived formulas : 0
% 0.99/0.61 # Current number of archived clauses : 61
% 0.99/0.61 # Clause-clause subsumption calls (NU) : 0
% 0.99/0.61 # Rec. Clause-clause subsumption calls : 0
% 0.99/0.61 # Non-unit clause-clause subsumptions : 0
% 0.99/0.61 # Unit Clause-clause subsumption calls : 11
% 0.99/0.61 # Rewrite failures with RHS unbound : 0
% 0.99/0.61 # BW rewrite match attempts : 460
% 0.99/0.61 # BW rewrite match successes : 103
% 0.99/0.61 # Condensation attempts : 0
% 0.99/0.61 # Condensation successes : 0
% 0.99/0.61 # Termbank termtop insertions : 132415
% 0.99/0.61 # Search garbage collected termcells : 2
% 0.99/0.61
% 0.99/0.61 # -------------------------------------------------
% 0.99/0.61 # User time : 0.096 s
% 0.99/0.61 # System time : 0.007 s
% 0.99/0.61 # Total time : 0.102 s
% 0.99/0.61 # Maximum resident set size: 1616 pages
% 0.99/0.61
% 0.99/0.61 # -------------------------------------------------
% 0.99/0.61 # User time : 0.096 s
% 0.99/0.61 # System time : 0.009 s
% 0.99/0.61 # Total time : 0.105 s
% 0.99/0.61 # Maximum resident set size: 1684 pages
% 0.99/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------