TSTP Solution File: SWV232+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV232+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:43:47 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 127 ( 82 equ)
% Maximal formula atoms : 29 ( 10 avg)
% Number of connectives : 173 ( 58 ~; 26 |; 79 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 24 ( 4 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0841,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) )
=> ( ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 )
=> a_select2(rho,n1) = n0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TF7SUI5xmU/E---3.1_13837.p',quaternion_ds1_symm_0841) ).
fof(c_0_1,plain,
! [X20,X4] :
( epred1_2(X4,X20)
<=> ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 ) ),
introduced(definition) ).
fof(c_0_2,plain,
! [X20,X4] :
( epred1_2(X4,X20)
=> ( ~ ( n0 = X4
& n1 = X20 )
& ~ ( n0 = X4
& n2 = X20 )
& ~ ( n0 = X20
& n2 = X4 )
& ~ ( n1 = X4
& n1 = X20 )
& ~ ( n1 = X4
& n2 = X20 )
& ~ ( n1 = X20
& n2 = X4 )
& ~ ( n2 = X4
& n2 = X20 )
& n0 = X20
& n1 = X4
& n1 = X20
& n2 = X4 ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_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) )
=> ( epred1_2(X4,X20)
=> a_select2(rho,n1) = n0 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0841]),c_0_1]) ).
fof(c_0_4,plain,
! [X71,X72] :
( ( n0 != X72
| n1 != X71
| ~ epred1_2(X72,X71) )
& ( n0 != X72
| n2 != X71
| ~ epred1_2(X72,X71) )
& ( n0 != X71
| n2 != X72
| ~ epred1_2(X72,X71) )
& ( n1 != X72
| n1 != X71
| ~ epred1_2(X72,X71) )
& ( n1 != X72
| n2 != X71
| ~ epred1_2(X72,X71) )
& ( n1 != X71
| n2 != X72
| ~ epred1_2(X72,X71) )
& ( n2 != X72
| n2 != X71
| ~ epred1_2(X72,X71) )
& ( n0 = X71
| ~ epred1_2(X72,X71) )
& ( n1 = X72
| ~ epred1_2(X72,X71) )
& ( n1 = X71
| ~ epred1_2(X72,X71) )
& ( n2 = X72
| ~ epred1_2(X72,X71) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
! [X28,X29] :
( ( ~ leq(n0,X28)
| ~ leq(n0,X29)
| ~ leq(X28,n5)
| ~ leq(X29,n5)
| a_select3(q_ds1_filter,X28,X29) = a_select3(q_ds1_filter,X29,X28) )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,n2)
& epred1_2(esk1_0,esk2_0)
& a_select2(rho,n1) != n0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( n0 != X1
| n2 != X2
| ~ epred1_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( n2 = X1
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( n0 = X1
| ~ epred1_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
~ epred1_2(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV232+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 04:31:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.TF7SUI5xmU/E---3.1_13837.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 13954 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.20/0.51 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 13957 completed with status 0
% 0.20/0.51 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 85
% 0.20/0.51 # Removed by relevancy pruning/SinE : 29
% 0.20/0.51 # Initial clauses : 75
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 75
% 0.20/0.51 # Processed clauses : 39
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 39
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 5
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 6
% 0.20/0.51 # ...of the previous two non-redundant : 5
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 3
% 0.20/0.51 # Paramodulations : 5
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 1
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 33
% 0.20/0.51 # Positive orientable unit clauses : 30
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 3
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 41
% 0.20/0.51 # ...number of literals in the above : 97
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 6
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 9
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 9
% 0.20/0.51 # Non-unit clause-clause subsumptions : 3
% 0.20/0.51 # Unit Clause-clause subsumption calls : 5
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 4
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3502
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.004 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1928 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1796 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------