TSTP Solution File: LAT028-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT028-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:26 EDT 2023
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 37 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 86 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_1,axiom,
meet(meet(join(X1,X2),join(X3,X2)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',wal_1) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',commutativity_of_meet) ).
cnf(wal_2_2,axiom,
join(join(meet2(X1,X2),meet2(X3,X2)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',wal_2_2) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',commutativity_of_join) ).
cnf(wal_2,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',wal_2) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',idempotence_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',idempotence_of_join) ).
cnf(wal_1_2,axiom,
meet2(meet2(join(X1,X2),join(X3,X2)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',wal_1_2) ).
cnf(commutativity_of_meet2,axiom,
meet2(X1,X2) = meet2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',commutativity_of_meet2) ).
cnf(name,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/tmp/tmp.dLTA1KKgWr/E---3.1_32488.p',name) ).
cnf(c_0_10,axiom,
meet(meet(join(X1,X2),join(X3,X2)),X2) = X2,
wal_1 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,axiom,
join(join(meet2(X1,X2),meet2(X3,X2)),X2) = X2,
wal_2_2 ).
cnf(c_0_13,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_14,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
wal_2 ).
cnf(c_0_15,plain,
meet(X1,meet(join(X2,X1),join(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_17,plain,
join(X1,join(meet2(X2,X1),meet2(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_19,axiom,
meet2(meet2(join(X1,X2),join(X3,X2)),X2) = X2,
wal_1_2 ).
cnf(c_0_20,axiom,
meet2(X1,X2) = meet2(X2,X1),
commutativity_of_meet2 ).
cnf(c_0_21,plain,
join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_22,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
join(X1,meet2(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
meet2(X1,meet2(join(X2,X1),join(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
join(X1,join(meet(X2,X1),meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_26,plain,
meet(X1,meet2(X2,X1)) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).
cnf(c_0_27,plain,
meet2(join(meet(X1,X2),meet(X3,X2)),meet2(X2,join(X4,join(meet(X1,X2),meet(X3,X2))))) = join(meet(X1,X2),meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_20]) ).
cnf(c_0_28,plain,
join(X1,join(meet(X1,X2),meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
join(X1,join(meet2(X2,X1),meet2(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_30,plain,
meet(X1,meet2(X1,X2)) = meet2(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,plain,
meet2(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),c_0_18]),c_0_20]) ).
cnf(c_0_32,plain,
meet(join(meet2(X1,X2),meet2(X3,X2)),meet(X2,join(X4,join(meet2(X1,X2),meet2(X3,X2))))) = join(meet2(X1,X2),meet2(X3,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_33,plain,
join(X1,join(meet2(X1,X2),meet2(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_34,plain,
meet(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
meet(a,b) != meet2(a,b),
name ).
cnf(c_0_36,plain,
meet(X1,X2) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18]),c_0_34]),c_0_18]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LAT028-1 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 10:42:48 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.dLTA1KKgWr/E---3.1_32488.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 32639 completed with status 0
% 0.15/0.45 # Result found by sh5l
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.45 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.45 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 32655 completed with status 0
% 0.15/0.45 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.45 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Unsatisfiable
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 11
% 0.15/0.45 # Removed by relevancy pruning/SinE : 0
% 0.15/0.45 # Initial clauses : 11
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 11
% 0.15/0.45 # Processed clauses : 199
% 0.15/0.45 # ...of these trivial : 110
% 0.15/0.45 # ...subsumed : 12
% 0.15/0.45 # ...remaining for further processing : 77
% 0.15/0.45 # Other redundant clauses eliminated : 0
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 0
% 0.15/0.45 # Backward-rewritten : 34
% 0.15/0.45 # Generated clauses : 2629
% 0.15/0.45 # ...of the previous two non-redundant : 1386
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 0
% 0.15/0.45 # Paramodulations : 2629
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 0
% 0.15/0.45 # Total rewrite steps : 3148
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 32
% 0.15/0.45 # Positive orientable unit clauses : 30
% 0.15/0.45 # Positive unorientable unit clauses: 2
% 0.15/0.45 # Negative unit clauses : 0
% 0.15/0.45 # Non-unit-clauses : 0
% 0.15/0.45 # Current number of unprocessed clauses: 1198
% 0.15/0.45 # ...number of literals in the above : 1198
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 45
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.45 # Non-unit clause-clause subsumptions : 0
% 0.15/0.45 # Unit Clause-clause subsumption calls : 0
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 109
% 0.15/0.45 # BW rewrite match successes : 44
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 23745
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.018 s
% 0.15/0.45 # System time : 0.002 s
% 0.15/0.45 # Total time : 0.020 s
% 0.15/0.45 # Maximum resident set size: 1420 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.018 s
% 0.15/0.45 # System time : 0.004 s
% 0.15/0.45 # Total time : 0.022 s
% 0.15/0.45 # Maximum resident set size: 1672 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------