TSTP Solution File: KRS013-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.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 : 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 03:00:20 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.10/0.12 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/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.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 17:16:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 33 Number of unprocessed: 33
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 33 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 2 conjectures.
% 0.13/0.37 # There are 2 start rule candidates:
% 0.13/0.37 # Found 2 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 2 start rule tableaux created.
% 0.13/0.37 # 31 extension rule candidate clauses
% 0.13/0.37 # 2 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 9 tableaux to operate on
% 0.13/0.38 # There were 1 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 1 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 1 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_34, negated_conjecture, (e(exist))).
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (~f(exist))).
% 0.13/0.38 cnf(i_0_36, plain, (t2least(X1)|~c(X1))).
% 0.13/0.38 cnf(i_0_42, plain, (t1most(X1)|~d(X1))).
% 0.13/0.38 cnf(i_0_61, plain, (f(X1)|~s1most(u6r1(X1)))).
% 0.13/0.38 cnf(i_0_37, plain, (c(X1)|~t2least(X1))).
% 0.13/0.38 cnf(i_0_43, plain, (d(X1)|~t1most(X1))).
% 0.13/0.38 cnf(i_0_38, plain, (~equalish(u1r2(X1),u1r1(X1))|~t2least(X1))).
% 0.13/0.38 cnf(i_0_56, plain, (~s2least(X1)|~equalish(u5r2(X1),u5r1(X1)))).
% 0.13/0.38 cnf(i_0_48, plain, (d(X1)|~r(X2,X1)|~e(X2))).
% 0.13/0.38 cnf(i_0_60, plain, (s1most(X1)|~r(X2,X1)|~f(X2))).
% 0.13/0.38 cnf(i_0_62, plain, (r(X1,u6r1(X1))|f(X1))).
% 0.13/0.38 cnf(i_0_50, plain, (e(X1)|~d(u4r2(X1))|~c(u4r1(X1)))).
% 0.13/0.38 cnf(i_0_45, plain, (t1most(X1)|~equalish(u3r2(X1),u3r1(X1)))).
% 0.13/0.38 cnf(i_0_64, plain, (s1most(X1)|~equalish(u7r2(X1),u7r1(X1)))).
% 0.13/0.38 cnf(i_0_49, plain, (c(X1)|~s2least(X1)|~r(X2,X1)|~e(X2))).
% 0.13/0.38 cnf(i_0_47, plain, (t1most(X1)|t(X1,u3r2(X1)))).
% 0.13/0.38 cnf(i_0_46, plain, (t1most(X1)|t(X1,u3r1(X1)))).
% 0.13/0.38 cnf(i_0_40, plain, (t(X1,u1r2(X1))|~t2least(X1))).
% 0.13/0.38 cnf(i_0_39, plain, (t(X1,u1r1(X1))|~t2least(X1))).
% 0.13/0.38 cnf(i_0_58, plain, (s(X1,u5r2(X1))|~s2least(X1))).
% 0.13/0.38 cnf(i_0_57, plain, (s(X1,u5r1(X1))|~s2least(X1))).
% 0.13/0.38 cnf(i_0_66, plain, (s1most(X1)|s(X1,u7r2(X1)))).
% 0.13/0.38 cnf(i_0_52, plain, (s2least(u4r1(X1))|e(X1)|~d(u4r2(X1)))).
% 0.13/0.38 cnf(i_0_65, plain, (s1most(X1)|s(X1,u7r1(X1)))).
% 0.13/0.38 cnf(i_0_54, plain, (r(X1,u4r1(X1))|e(X1)|~d(u4r2(X1)))).
% 0.13/0.38 cnf(i_0_51, plain, (r(X1,u4r2(X1))|e(X1)|~c(u4r1(X1)))).
% 0.13/0.38 cnf(i_0_53, plain, (s2least(u4r1(X1))|r(X1,u4r2(X1))|e(X1))).
% 0.13/0.38 cnf(i_0_55, plain, (r(X1,u4r2(X1))|r(X1,u4r1(X1))|e(X1))).
% 0.13/0.38 cnf(i_0_44, plain, (equalish(X1,X2)|~t1most(X3)|~t(X3,X2)|~t(X3,X1))).
% 0.13/0.38 cnf(i_0_63, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))).
% 0.13/0.38 cnf(i_0_41, plain, (equalish(X1,X2)|t2least(X3)|~t(X3,X2)|~t(X3,X1))).
% 0.13/0.38 cnf(i_0_59, plain, (s2least(X1)|equalish(X2,X3)|~s(X1,X3)|~s(X1,X2))).
% 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 5 steps
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (~f(exist)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_67, plain, (~f(exist)), inference(extension_rule, [i_0_62])).
% 0.13/0.38 cnf(i_0_89, plain, (r(exist,u6r1(exist))), inference(extension_rule, [i_0_48])).
% 0.13/0.38 cnf(i_0_405, plain, (~e(exist)), inference(closure_rule, [i_0_34])).
% 0.13/0.38 cnf(i_0_403, plain, (d(u6r1(exist))), inference(etableau_closure_rule, [i_0_403, ...])).
% 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 (2531) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------