TSTP Solution File: SWV191+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV191+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:19 EDT 2023
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 124 ( 86 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 118 ( 15 ~; 7 |; 90 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.ViTJZUxAFK/E---3.1_27957.p',irreflexivity_gt) ).
fof(quaternion_ds1_inuse_0002,conjecture,
( ( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use )
=> ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n2)
& leq(X18,tptp_minus_1) )
=> a_select3(z_defuse,X14,X18) = use ) ),
file('/export/starexec/sandbox/tmp/tmp.ViTJZUxAFK/E---3.1_27957.p',quaternion_ds1_inuse_0002) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ViTJZUxAFK/E---3.1_27957.p',leq_succ_gt) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.ViTJZUxAFK/E---3.1_27957.p',transitivity_leq) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/tmp/tmp.ViTJZUxAFK/E---3.1_27957.p',succ_tptp_minus_1) ).
fof(c_0_5,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_6,negated_conjecture,
~ ( ( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use )
=> ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n2)
& leq(X18,tptp_minus_1) )
=> a_select3(z_defuse,X14,X18) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0002]) ).
fof(c_0_7,plain,
! [X65] : ~ gt(X65,X65),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X44,X45] :
( ~ leq(succ(X44),X45)
| gt(X45,X44) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_9,plain,
! [X31,X32,X33] :
( ~ leq(X31,X32)
| ~ leq(X32,X33)
| leq(X31,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_10,negated_conjecture,
( a_select2(rho_defuse,n0) = use
& a_select2(rho_defuse,n1) = use
& a_select2(rho_defuse,n2) = use
& a_select2(sigma_defuse,n0) = use
& a_select2(sigma_defuse,n1) = use
& a_select2(sigma_defuse,n2) = use
& a_select2(sigma_defuse,n3) = use
& a_select2(sigma_defuse,n4) = use
& a_select2(sigma_defuse,n5) = use
& a_select3(u_defuse,n0,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n2,n0) = use
& a_select2(xinit_defuse,n3) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_mean_defuse,n0) = use
& a_select2(xinit_mean_defuse,n1) = use
& a_select2(xinit_mean_defuse,n2) = use
& a_select2(xinit_mean_defuse,n3) = use
& a_select2(xinit_mean_defuse,n4) = use
& a_select2(xinit_mean_defuse,n5) = use
& a_select2(xinit_noise_defuse,n0) = use
& a_select2(xinit_noise_defuse,n1) = use
& a_select2(xinit_noise_defuse,n2) = use
& a_select2(xinit_noise_defuse,n3) = use
& a_select2(xinit_noise_defuse,n4) = use
& a_select2(xinit_noise_defuse,n5) = use
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n2)
& leq(esk2_0,tptp_minus_1)
& a_select3(z_defuse,esk1_0,esk2_0) != use ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
leq(esk2_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_17,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SWV191+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n001.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 04:27:22 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.ViTJZUxAFK/E---3.1_27957.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # new_bool_3 with pid 28035 completed with status 0
% 0.14/0.43 # Result found by new_bool_3
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.14/0.43 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.14/0.43 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 28038 completed with status 0
% 0.14/0.43 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.14/0.43 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.14/0.43 # Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 85
% 0.14/0.43 # Removed by relevancy pruning/SinE : 29
% 0.14/0.43 # Initial clauses : 89
% 0.14/0.43 # Removed in clause preprocessing : 0
% 0.14/0.43 # Initial clauses in saturation : 89
% 0.14/0.43 # Processed clauses : 182
% 0.14/0.43 # ...of these trivial : 1
% 0.14/0.43 # ...subsumed : 13
% 0.14/0.43 # ...remaining for further processing : 168
% 0.14/0.43 # Other redundant clauses eliminated : 0
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 0
% 0.14/0.43 # Backward-rewritten : 0
% 0.14/0.43 # Generated clauses : 270
% 0.14/0.43 # ...of the previous two non-redundant : 214
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 0
% 0.14/0.43 # Paramodulations : 264
% 0.14/0.43 # Factorizations : 6
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 0
% 0.14/0.43 # Total rewrite steps : 146
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 168
% 0.14/0.43 # Positive orientable unit clauses : 92
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 44
% 0.14/0.43 # Non-unit-clauses : 32
% 0.14/0.43 # Current number of unprocessed clauses: 121
% 0.14/0.43 # ...number of literals in the above : 258
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 0
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 45
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 16
% 0.14/0.43 # Non-unit clause-clause subsumptions : 0
% 0.14/0.43 # Unit Clause-clause subsumption calls : 465
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 6
% 0.14/0.43 # BW rewrite match successes : 0
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 6527
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.006 s
% 0.14/0.43 # System time : 0.006 s
% 0.14/0.43 # Total time : 0.012 s
% 0.14/0.43 # Maximum resident set size: 1936 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.008 s
% 0.14/0.43 # System time : 0.008 s
% 0.14/0.43 # Total time : 0.017 s
% 0.14/0.43 # Maximum resident set size: 1796 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------