TSTP Solution File: SWV009-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n006.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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:18:54 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 00:07:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 9 Number of unprocessed: 9
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 9 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 9 conjectures.
% 0.13/0.38 # There are 9 start rule candidates:
% 0.13/0.38 # Found 5 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 9 start rule tableaux created.
% 0.13/0.38 # 4 extension rule candidate clauses
% 0.13/0.38 # 5 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # Closed tableau found in foldup close cycle with 1 folds and 3 closures done.
% 0.13/0.38 # There were 0 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (less_or_equal(m,p))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (less_or_equal(p,q))).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (less_or_equal(q,n))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (less(j,i))).
% 0.13/0.38 cnf(i_0_18, negated_conjecture, (~less_or_equal(a(p),a(q)))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (less(X1,X2)|less_or_equal(X2,X1))).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (less_or_equal(a(X1),a(X2))|~less_or_equal(X2,j)|~less_or_equal(m,X1)|~less_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (less_or_equal(a(X1),a(X2))|~less_or_equal(X2,n)|~less_or_equal(i,X1)|~less_or_equal(X1,X2))).
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (less_or_equal(a(X1),a(X2))|~less(X1,i)|~less(j,X2)|~less_or_equal(X2,n)|~less_or_equal(m,X1))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 14 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (less_or_equal(a(p),a(q))|~less(p,i)|~less(j,q)|~less_or_equal(q,n)|~less_or_equal(m,p)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_19, plain, (less_or_equal(a(p),a(q))), inference(closure_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_22, plain, (~less_or_equal(q,n)), inference(closure_rule, [i_0_14])).
% 0.13/0.38 cnf(i_0_23, plain, (~less_or_equal(m,p)), inference(closure_rule, [i_0_12])).
% 0.13/0.38 cnf(i_0_20, plain, (~less(p,i)), inference(extension_rule, [i_0_10])).
% 0.13/0.38 cnf(i_0_53, plain, (less_or_equal(i,p)), inference(extension_rule, [i_0_17])).
% 0.13/0.38 cnf(i_0_59, plain, (less_or_equal(a(p),a(q))), inference(closure_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_60, plain, (~less_or_equal(q,n)), inference(closure_rule, [i_0_14])).
% 0.13/0.38 cnf(i_0_62, plain, (~less_or_equal(p,q)), inference(closure_rule, [i_0_13])).
% 0.13/0.38 cnf(i_0_21, plain, (~less(j,q)), inference(extension_rule, [i_0_10])).
% 0.13/0.38 cnf(i_0_73, plain, (less_or_equal(q,j)), inference(extension_rule, [i_0_16])).
% 0.13/0.38 cnf(i_0_79, plain, (less_or_equal(a(p),a(q))), inference(closure_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_81, plain, (~less_or_equal(m,p)), inference(closure_rule, [i_0_12])).
% 0.13/0.38 cnf(i_0_82, plain, (~less_or_equal(p,q)), inference(closure_rule, [i_0_13])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (27813) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------