TSTP Solution File: KRS035+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS035+1 : TPTP v8.1.0. Released v3.1.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:22 EDT 2022
% Result : Satisfiable 0.10s 0.35s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KRS035+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue Jun 7 05:56:50 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.35 # No SInE strategy applied
% 0.10/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.10/0.35 # and selection function SelectCQIPrecWNTNp.
% 0.10/0.35 #
% 0.10/0.35 # Presaturation interreduction done
% 0.10/0.35 # Number of axioms: 18 Number of unprocessed: 18
% 0.10/0.35 # Tableaux proof search.
% 0.10/0.35 # APR header successfully linked.
% 0.10/0.35 # Hello from C++
% 0.10/0.35 # The folding up rule is enabled...
% 0.10/0.35 # Local unification is enabled...
% 0.10/0.35 # Any saturation attempts will use folding labels...
% 0.10/0.35 # 18 beginning clauses after preprocessing and clausification
% 0.10/0.35 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.10/0.35 # No conjectures.
% 0.10/0.35 # There are 18 start rule candidates:
% 0.10/0.35 # Found 2 unit axioms.
% 0.10/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.10/0.35 # 18 start rule tableaux created.
% 0.10/0.35 # 16 extension rule candidate clauses
% 0.10/0.35 # 2 unit axiom clauses
% 0.10/0.35
% 0.10/0.35 # Requested 8, 32 cores available to the main process.
% 0.10/0.35 # 11892 Satisfiable branch
% 0.10/0.35 # Satisfiable branch found.
% 0.10/0.35 # There were 1 total branch saturation attempts.
% 0.10/0.35 # There were 0 of these attempts blocked.
% 0.10/0.35 # There were 0 deferred branch saturation attempts.
% 0.10/0.35 # There were 0 free duplicated saturations.
% 0.10/0.35 # There were 0 total successful branch saturations.
% 0.10/0.35 # There were 0 successful branch saturations in interreduction.
% 0.10/0.35 # There were 0 successful branch saturations on the branch.
% 0.10/0.35 # There were 0 successful branch saturations after the branch.
% 0.10/0.35 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 # Begin clausification derivation
% 0.10/0.35
% 0.10/0.35 # End clausification derivation
% 0.10/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.35 cnf(i_0_32, plain, (cSatisfiable(i2003_11_14_17_15_44810))).
% 0.10/0.35 cnf(i_0_15, plain, (~cowlNothing(X1))).
% 0.10/0.35 cnf(i_0_25, plain, (~ca(X1)|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.10/0.35 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.10/0.35 cnf(i_0_22, plain, (ca(esk2_1(X1))|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_20, plain, (ca(esk3_1(X1))|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_27, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.10/0.35 cnf(i_0_30, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.10/0.35 cnf(i_0_33, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.10/0.35 cnf(i_0_28, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.10/0.35 cnf(i_0_29, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.10/0.35 cnf(i_0_21, plain, (rinvF(X1,esk3_1(X1))|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_24, plain, (rinvR(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_23, plain, (rinvF(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))).
% 0.10/0.35 cnf(i_0_26, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.10/0.35 cnf(i_0_31, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.10/0.35 cnf(i_0_19, plain, (ca(X1)|cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X2,X3)|~rinvF(X1,X4)|~ca(X4)|~ca(X3))).
% 0.10/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.10/0.35 # Begin printing tableau
% 0.10/0.35 # Found 4 steps
% 0.10/0.35 cnf(i_0_21, plain, (rinvF(i2003_11_14_17_15_44810,esk3_1(i2003_11_14_17_15_44810))|~cSatisfiable(i2003_11_14_17_15_44810)), inference(start_rule)).
% 0.10/0.35 cnf(i_0_57, plain, (~cSatisfiable(i2003_11_14_17_15_44810)), inference(closure_rule, [i_0_32])).
% 0.10/0.35 cnf(i_0_56, plain, (rinvF(i2003_11_14_17_15_44810,esk3_1(i2003_11_14_17_15_44810))), inference(extension_rule, [i_0_28])).
% 0.10/0.35 cnf(i_0_130, plain, (rf(esk3_1(i2003_11_14_17_15_44810),i2003_11_14_17_15_44810)), inference(extension_rule, [i_0_33])).
% 0.10/0.35 # End printing tableau
% 0.10/0.35 # SZS output end
% 0.10/0.35 # Branches closed with saturation will be marked with an "s"
% 0.10/0.35 # Child (11892) has found a proof.
% 0.10/0.35
% 0.10/0.35 # Proof search is over...
% 0.10/0.35 # Freeing feature tree
%------------------------------------------------------------------------------