TSTP Solution File: SWV222+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV222+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:56:23 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 387 ( 307 equ)
% Maximal formula atoms : 113 ( 29 avg)
% Number of connectives : 596 ( 222 ~; 78 |; 283 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 44 ( 16 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 26 ( 4 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0441,conjecture,
( ( ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) )
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 )
=> a_select2(xinit_noise,n0) = n0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.C06DaYmhcA/E---3.1_31304.p',quaternion_ds1_symm_0441) ).
fof(c_0_1,plain,
! [X21,X22] :
( epred2_2(X22,X21)
<=> ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
<=> ( ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(n0,X20)
& leq(X4,n2)
& leq(X20,n2) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) ) ),
introduced(definition) ).
fof(c_0_3,plain,
! [X21,X22] :
( epred2_2(X22,X21)
=> ( ~ ( n0 = X21
& n1 = X22 )
& ~ ( n0 = X21
& n2 = X22 )
& ~ ( n0 = X21
& n3 = X22 )
& ~ ( n0 = X21
& n4 = X22 )
& ~ ( n0 = X21
& n5 = X22 )
& ~ ( n0 = X22
& n1 = X21 )
& ~ ( n0 = X22
& n2 = X21 )
& ~ ( n0 = X22
& n3 = X21 )
& ~ ( n0 = X22
& n4 = X21 )
& ~ ( n0 = X22
& n5 = X21 )
& ~ ( n1 = X21
& n1 = X22 )
& ~ ( n1 = X21
& n2 = X22 )
& ~ ( n1 = X21
& n3 = X22 )
& ~ ( n1 = X21
& n4 = X22 )
& ~ ( n1 = X21
& n5 = X22 )
& ~ ( n1 = X22
& n2 = X21 )
& ~ ( n1 = X22
& n3 = X21 )
& ~ ( n1 = X22
& n4 = X21 )
& ~ ( n1 = X22
& n5 = X21 )
& ~ ( n2 = X21
& n2 = X22 )
& ~ ( n2 = X21
& n3 = X22 )
& ~ ( n2 = X21
& n4 = X22 )
& ~ ( n2 = X21
& n5 = X22 )
& ~ ( n2 = X22
& n3 = X21 )
& ~ ( n2 = X22
& n4 = X21 )
& ~ ( n2 = X22
& n5 = X21 )
& ~ ( n3 = X21
& n3 = X22 )
& ~ ( n3 = X21
& n4 = X22 )
& ~ ( n3 = X21
& n5 = X22 )
& ~ ( n3 = X22
& n4 = X21 )
& ~ ( n3 = X22
& n5 = X21 )
& ~ ( n4 = X21
& n4 = X22 )
& ~ ( n4 = X21
& n5 = X22 )
& ~ ( n4 = X22
& n5 = X21 )
& ~ ( n5 = X21
& n5 = X22 )
& n0 = X21
& n0 = X22
& n1 = X21
& n3 = X22 ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_4,negated_conjecture,
~ ( epred1_0
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( epred2_2(X22,X21)
=> a_select2(xinit_noise,n0) = n0 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0441]),c_0_2]),c_0_1]) ).
fof(c_0_5,plain,
! [X73,X74] :
( ( n0 != X73
| n1 != X74
| ~ epred2_2(X74,X73) )
& ( n0 != X73
| n2 != X74
| ~ epred2_2(X74,X73) )
& ( n0 != X73
| n3 != X74
| ~ epred2_2(X74,X73) )
& ( n0 != X73
| n4 != X74
| ~ epred2_2(X74,X73) )
& ( n0 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n0 != X74
| n1 != X73
| ~ epred2_2(X74,X73) )
& ( n0 != X74
| n2 != X73
| ~ epred2_2(X74,X73) )
& ( n0 != X74
| n3 != X73
| ~ epred2_2(X74,X73) )
& ( n0 != X74
| n4 != X73
| ~ epred2_2(X74,X73) )
& ( n0 != X74
| n5 != X73
| ~ epred2_2(X74,X73) )
& ( n1 != X73
| n1 != X74
| ~ epred2_2(X74,X73) )
& ( n1 != X73
| n2 != X74
| ~ epred2_2(X74,X73) )
& ( n1 != X73
| n3 != X74
| ~ epred2_2(X74,X73) )
& ( n1 != X73
| n4 != X74
| ~ epred2_2(X74,X73) )
& ( n1 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n1 != X74
| n2 != X73
| ~ epred2_2(X74,X73) )
& ( n1 != X74
| n3 != X73
| ~ epred2_2(X74,X73) )
& ( n1 != X74
| n4 != X73
| ~ epred2_2(X74,X73) )
& ( n1 != X74
| n5 != X73
| ~ epred2_2(X74,X73) )
& ( n2 != X73
| n2 != X74
| ~ epred2_2(X74,X73) )
& ( n2 != X73
| n3 != X74
| ~ epred2_2(X74,X73) )
& ( n2 != X73
| n4 != X74
| ~ epred2_2(X74,X73) )
& ( n2 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n2 != X74
| n3 != X73
| ~ epred2_2(X74,X73) )
& ( n2 != X74
| n4 != X73
| ~ epred2_2(X74,X73) )
& ( n2 != X74
| n5 != X73
| ~ epred2_2(X74,X73) )
& ( n3 != X73
| n3 != X74
| ~ epred2_2(X74,X73) )
& ( n3 != X73
| n4 != X74
| ~ epred2_2(X74,X73) )
& ( n3 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n3 != X74
| n4 != X73
| ~ epred2_2(X74,X73) )
& ( n3 != X74
| n5 != X73
| ~ epred2_2(X74,X73) )
& ( n4 != X73
| n4 != X74
| ~ epred2_2(X74,X73) )
& ( n4 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n4 != X74
| n5 != X73
| ~ epred2_2(X74,X73) )
& ( n5 != X73
| n5 != X74
| ~ epred2_2(X74,X73) )
& ( n0 = X73
| ~ epred2_2(X74,X73) )
& ( n0 = X74
| ~ epred2_2(X74,X73) )
& ( n1 = X73
| ~ epred2_2(X74,X73) )
& ( n3 = X74
| ~ epred2_2(X74,X73) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n5)
& leq(esk2_0,n5)
& epred2_2(esk2_0,esk1_0)
& a_select2(xinit_noise,n0) != n0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( n0 != X1
| n1 != X2
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( n1 = X1
| ~ epred2_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( n0 = X1
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
epred2_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
~ epred2_2(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV222+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n008.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 03:44:28 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.C06DaYmhcA/E---3.1_31304.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 31382 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.14/0.41 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 31386 completed with status 0
% 0.14/0.41 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.14/0.41 # Preprocessing time : 0.002 s
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 85
% 0.14/0.41 # Removed by relevancy pruning/SinE : 29
% 0.14/0.41 # Initial clauses : 105
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 105
% 0.14/0.41 # Processed clauses : 47
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 1
% 0.14/0.41 # ...remaining for further processing : 46
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 7
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 12
% 0.14/0.41 # ...of the previous two non-redundant : 7
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 5
% 0.14/0.41 # Paramodulations : 11
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 7
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 38
% 0.14/0.41 # Positive orientable unit clauses : 34
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 3
% 0.14/0.41 # Non-unit-clauses : 1
% 0.14/0.41 # Current number of unprocessed clauses: 65
% 0.14/0.41 # ...number of literals in the above : 175
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 8
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 33
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 33
% 0.14/0.41 # Non-unit clause-clause subsumptions : 6
% 0.14/0.41 # Unit Clause-clause subsumption calls : 8
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 4
% 0.14/0.41 # BW rewrite match successes : 0
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 4786
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.007 s
% 0.14/0.41 # Maximum resident set size: 2100 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.006 s
% 0.14/0.41 # System time : 0.006 s
% 0.14/0.41 # Total time : 0.012 s
% 0.14/0.41 # Maximum resident set size: 1808 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------