↑ Up

Etableau---0.67.SAT-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : KRS046+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 : n018.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:24 EDT 2022

% Result   : Satisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KRS046+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun  7 17:45:06 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.36  # and selection function SelectCQIPrecWNTNp.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  # Number of axioms: 24 Number of unprocessed: 24
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # 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  # 24 beginning clauses after preprocessing and clausification
% 0.13/0.37  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.13/0.37  # No conjectures.
% 0.13/0.37  # There are 24 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  # 24 start rule tableaux created.
% 0.13/0.37  # 22 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  # 14812 Satisfiable branch
% 0.13/0.37  # 14811 Satisfiable branch
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # 14814 Satisfiable branch
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_42, plain, (cSatisfiable(i2003_11_14_17_16_25617))).
% 0.13/0.37  cnf(i_0_19, plain, (~cowlNothing(X1))).
% 0.13/0.37  cnf(i_0_22, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_30, plain, (~ra_Px1(X1,X2)|~ca(X1))).
% 0.13/0.37  cnf(i_0_26, plain, (caxcomp(X1)|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_21, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_27, plain, (ca(esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (caxcomp(X1)|~ra_Px1(X1,X2))).
% 0.13/0.37  cnf(i_0_37, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.13/0.37  cnf(i_0_40, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.13/0.37  cnf(i_0_43, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.13/0.37  cnf(i_0_34, plain, (ca(esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_24, plain, (ca_Vx2(esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.13/0.37  cnf(i_0_39, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.13/0.37  cnf(i_0_32, plain, (ra_Px1(X1,esk4_1(X1))|~caxcomp(X1))).
% 0.13/0.37  cnf(i_0_29, plain, (ra_Px1(X1,esk3_1(X1))|ca(X1))).
% 0.13/0.37  cnf(i_0_28, plain, (rinvF(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_33, plain, (ca_Vx2(X1)|~rinvF(X1,X2)|~ca(X2))).
% 0.13/0.37  cnf(i_0_35, plain, (rinvF(X1,esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.13/0.37  cnf(i_0_41, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.13/0.37  cnf(i_0_23, plain, (cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X1,X3)|~caxcomp(X1)|~ca_Vx2(X2)|~ca(X3))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 4 steps
% 0.13/0.37  cnf(i_0_26, plain, (caxcomp(i2003_11_14_17_16_25617)|~cSatisfiable(i2003_11_14_17_16_25617)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_51, plain, (~cSatisfiable(i2003_11_14_17_16_25617)), inference(closure_rule, [i_0_42])).
% 0.13/0.37  cnf(i_0_50, plain, (caxcomp(i2003_11_14_17_16_25617)), inference(extension_rule, [i_0_32])).
% 0.13/0.37  cnf(i_0_123, plain, (ra_Px1(i2003_11_14_17_16_25617,esk4_1(i2003_11_14_17_16_25617))), inference(extension_rule, [i_0_30])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_42, plain, (cSatisfiable(i2003_11_14_17_16_25617))).
% 0.13/0.37  cnf(i_0_19, plain, (~cowlNothing(X1))).
% 0.13/0.37  cnf(i_0_22, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_30, plain, (~ra_Px1(X1,X2)|~ca(X1))).
% 0.13/0.37  cnf(i_0_26, plain, (caxcomp(X1)|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_21, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_27, plain, (ca(esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (caxcomp(X1)|~ra_Px1(X1,X2))).
% 0.13/0.37  cnf(i_0_37, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.13/0.37  cnf(i_0_40, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.13/0.37  cnf(i_0_43, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.13/0.37  cnf(i_0_34, plain, (ca(esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_24, plain, (ca_Vx2(esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.13/0.37  cnf(i_0_39, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.13/0.37  cnf(i_0_32, plain, (ra_Px1(X1,esk4_1(X1))|~caxcomp(X1))).
% 0.13/0.37  cnf(i_0_29, plain, (ra_Px1(X1,esk3_1(X1))|ca(X1))).
% 0.13/0.37  cnf(i_0_28, plain, (rinvF(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_33, plain, (ca_Vx2(X1)|~rinvF(X1,X2)|~ca(X2))).
% 0.13/0.37  cnf(i_0_35, plain, (rinvF(X1,esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.13/0.37  cnf(i_0_41, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.13/0.37  cnf(i_0_23, plain, (cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X1,X3)|~caxcomp(X1)|~ca_Vx2(X2)|~ca(X3))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 6 steps
% 0.13/0.37  cnf(i_0_30, plain, (~ra_Px1(i2003_11_14_17_16_25617,esk4_1(i2003_11_14_17_16_25617))|~ca(i2003_11_14_17_16_25617)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_48, plain, (~ra_Px1(i2003_11_14_17_16_25617,esk4_1(i2003_11_14_17_16_25617))), inference(extension_rule, [i_0_32])).
% 0.13/0.37  cnf(i_0_124, plain, (~caxcomp(i2003_11_14_17_16_25617)), inference(extension_rule, [i_0_26])).
% 0.13/0.37  cnf(i_0_130, plain, (~cSatisfiable(i2003_11_14_17_16_25617)), inference(closure_rule, [i_0_42])).
% 0.13/0.37  cnf(i_0_49, plain, (~ca(i2003_11_14_17_16_25617)), inference(extension_rule, [i_0_29])).
% 0.13/0.37  cnf(i_0_155, plain, (ra_Px1(i2003_11_14_17_16_25617,esk3_1(i2003_11_14_17_16_25617))), inference(extension_rule, [i_0_31])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Satisfiable branch found.
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 0 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 0 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_42, plain, (cSatisfiable(i2003_11_14_17_16_25617))).
% 0.13/0.37  cnf(i_0_19, plain, (~cowlNothing(X1))).
% 0.13/0.37  cnf(i_0_22, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_30, plain, (~ra_Px1(X1,X2)|~ca(X1))).
% 0.13/0.37  cnf(i_0_26, plain, (caxcomp(X1)|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_21, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.13/0.37  cnf(i_0_27, plain, (ca(esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_31, plain, (caxcomp(X1)|~ra_Px1(X1,X2))).
% 0.13/0.37  cnf(i_0_37, plain, (rinvF(X1,X2)|~rf(X2,X1))).
% 0.13/0.37  cnf(i_0_40, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.13/0.37  cnf(i_0_43, plain, (rr(X1,X2)|~rf(X1,X2))).
% 0.13/0.37  cnf(i_0_34, plain, (ca(esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_24, plain, (ca_Vx2(esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_38, plain, (rf(X1,X2)|~rinvF(X2,X1))).
% 0.13/0.37  cnf(i_0_39, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.13/0.37  cnf(i_0_32, plain, (ra_Px1(X1,esk4_1(X1))|~caxcomp(X1))).
% 0.13/0.37  cnf(i_0_29, plain, (ra_Px1(X1,esk3_1(X1))|ca(X1))).
% 0.13/0.37  cnf(i_0_28, plain, (rinvF(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_33, plain, (ca_Vx2(X1)|~rinvF(X1,X2)|~ca(X2))).
% 0.13/0.37  cnf(i_0_35, plain, (rinvF(X1,esk5_1(X1))|~ca_Vx2(X1))).
% 0.13/0.37  cnf(i_0_25, plain, (rinvR(X1,esk2_1(X1))|~cSatisfiable(X1))).
% 0.13/0.37  cnf(i_0_36, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))).
% 0.13/0.37  cnf(i_0_41, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))).
% 0.13/0.37  cnf(i_0_23, plain, (cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X1,X3)|~caxcomp(X1)|~ca_Vx2(X2)|~ca(X3))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 4 steps
% 0.13/0.37  cnf(i_0_27, plain, (ca(esk1_1(i2003_11_14_17_16_25617))|~cSatisfiable(i2003_11_14_17_16_25617)), inference(start_rule)).
% 0.13/0.37  cnf(i_0_55, plain, (~cSatisfiable(i2003_11_14_17_16_25617)), inference(closure_rule, [i_0_42])).
% 0.13/0.37  cnf(i_0_54, plain, (ca(esk1_1(i2003_11_14_17_16_25617))), inference(extension_rule, [i_0_30])).
% 0.13/0.37  cnf(i_0_99, plain, (~ra_Px1(esk1_1(i2003_11_14_17_16_25617),esk4_1(esk1_1(i2003_11_14_17_16_25617)))), inference(extension_rule, [i_0_32])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # 14813 Satisfiable branch
% 0.13/0.37  # Child (14811) has found a proof.
% 0.13/0.37  
% 0.13/0.37  # Proof search is over...
% 0.13/0.37  # Freeing feature tree
%------------------------------------------------------------------------------