TSTP Solution File: SEU305+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU305+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 19:31:33 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 126 ( 25 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 142 ( 48 ~; 42 |; 32 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 47 ( 0 sgn; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(redefinition_k3_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.IPG5hTYh5I/E---3.1_4681.p',redefinition_k3_lattices) ).
fof(t26_lattices,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X2,X3)
& below(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IPG5hTYh5I/E---3.1_4681.p',t26_lattices) ).
fof(commutativity_k3_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.IPG5hTYh5I/E---3.1_4681.p',commutativity_k3_lattices) ).
fof(d3_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IPG5hTYh5I/E---3.1_4681.p',d3_lattices) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k3_lattices]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X2,X3)
& below(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t26_lattices])]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[commutativity_k3_lattices]) ).
fof(c_0_7,plain,
! [X22,X23,X24] :
( empty_carrier(X22)
| ~ join_commutative(X22)
| ~ join_semilatt_str(X22)
| ~ element(X23,the_carrier(X22))
| ~ element(X24,the_carrier(X22))
| join_commut(X22,X23,X24) = join(X22,X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_8,negated_conjecture,
( ~ empty_carrier(esk1_0)
& join_commutative(esk1_0)
& join_semilatt_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& element(esk3_0,the_carrier(esk1_0))
& below(esk1_0,esk2_0,esk3_0)
& below(esk1_0,esk3_0,esk2_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X16,X17,X18] :
( empty_carrier(X16)
| ~ join_commutative(X16)
| ~ join_semilatt_str(X16)
| ~ element(X17,the_carrier(X16))
| ~ element(X18,the_carrier(X16))
| join_commut(X16,X17,X18) = join_commut(X16,X18,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_lattices]) ).
cnf(c_0_11,plain,
( empty_carrier(X1)
| join_commut(X1,X2,X3) = join(X1,X2,X3)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
join_semilatt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
join_commutative(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( empty_carrier(X1)
| join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X10,X11,X12] :
( ( ~ below(X10,X11,X12)
| join(X10,X11,X12) = X12
| ~ element(X12,the_carrier(X10))
| ~ element(X11,the_carrier(X10))
| empty_carrier(X10)
| ~ join_semilatt_str(X10) )
& ( join(X10,X11,X12) != X12
| below(X10,X11,X12)
| ~ element(X12,the_carrier(X10))
| ~ element(X11,the_carrier(X10))
| empty_carrier(X10)
| ~ join_semilatt_str(X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_19,negated_conjecture,
( join_commut(esk1_0,X1,esk2_0) = join(esk1_0,X1,esk2_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( join_commut(esk1_0,X1,esk3_0) = join_commut(esk1_0,esk3_0,X1)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_21,plain,
( join(X1,X2,X3) = X3
| empty_carrier(X1)
| ~ below(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( join_commut(esk1_0,X1,esk3_0) = join(esk1_0,X1,esk3_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_23,negated_conjecture,
join_commut(esk1_0,esk2_0,esk3_0) = join(esk1_0,esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
( join(esk1_0,X1,esk2_0) = esk2_0
| ~ below(esk1_0,X1,esk2_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_13])]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
join(esk1_0,esk3_0,esk2_0) = join(esk1_0,esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]) ).
cnf(c_0_26,negated_conjecture,
below(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( join(esk1_0,X1,esk3_0) = esk3_0
| ~ below(esk1_0,X1,esk3_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_13])]),c_0_15]) ).
cnf(c_0_28,negated_conjecture,
join(esk1_0,esk2_0,esk3_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
below(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_12])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU305+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:07:24 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.IPG5hTYh5I/E---3.1_4681.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 4759 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGUSF-FFSM32-SFFFFFNN
% 0.18/0.46 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.46 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4762 completed with status 0
% 0.18/0.46 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGUSF-FFSM32-SFFFFFNN
% 0.18/0.46 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 42
% 0.18/0.46 # Removed by relevancy pruning/SinE : 34
% 0.18/0.46 # Initial clauses : 16
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 16
% 0.18/0.46 # Processed clauses : 55
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 5
% 0.18/0.46 # ...remaining for further processing : 50
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 2
% 0.18/0.46 # Generated clauses : 89
% 0.18/0.46 # ...of the previous two non-redundant : 80
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 89
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Total rewrite steps : 111
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 32
% 0.18/0.46 # Positive orientable unit clauses : 10
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 2
% 0.18/0.46 # Non-unit-clauses : 20
% 0.18/0.46 # Current number of unprocessed clauses: 56
% 0.18/0.46 # ...number of literals in the above : 194
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 18
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 28
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 27
% 0.18/0.46 # Non-unit clause-clause subsumptions : 5
% 0.18/0.46 # Unit Clause-clause subsumption calls : 1
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 4
% 0.18/0.46 # BW rewrite match successes : 2
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 3972
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.006 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.008 s
% 0.18/0.46 # Maximum resident set size: 1876 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.008 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.011 s
% 0.18/0.46 # Maximum resident set size: 1724 pages
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------